To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We review some old and new methods of reduction of the number of degrees of freedom from ∼ N2 to ∼N in the multimatrix integrals.
1. Introduction Multimatrix integrals of various types appear in many mathematical and physical applications, such as combinatorics of graphs, topology, integrable systems, string theory, theory of mesoscopic systems or statistical mechanics on random surfaces.
We will consider here only the case of hermitian matrices for which Q belongs to the U(N)-group.
In many applications “to solve” the corresponding matrix model usually means to reduce the number of variables by explicit integrations over most of the variables in such a way that instead of QN2original integrations (matrix elements) one would be left in the large N limit only with ∼ N integration variables. In this case the integration over the rest of the variables can be performed, at least in the widely used large N limit, by means of the saddle point approximation. A more sophisticated double scaling limit [1] is also possible (if possible at all) only after such a reduction. The key of success is in the fact that after reduction the effective action at the saddle point is still of the order ∼ N2whereas the corrections given by the logarithm of determinant of the second variation of the action cannot be bigger than ∼ N (the “entropy” of the remaining variables). The problem is thus reduced to the solution of the “classical” saddle point equations, instead of the “quantum” problem of functional (in the large N limit) integration over the original matrix variables.
This volume represents the most recent trends in the random matrix theory with a special emphasis on the exchange of ideas between physical and mathematical communities. The main topics include:
• random matrix theory and combinatorics
• scaling limits; universalities and phase transitions in matrix models
• topologico-combinatorial aspects of the theory of random matrix models
• scaling limit of correlations between zeros on complex and symplectic manifolds Most contributions are based on talks and series of lectures given by the authors during the MSRI semester “Random Matrix Models and Their Applications” in Spring 1999, and have an expository or pedagogical style.
One of the basic ideas of the MSRI semester was to bring together the leading experts, both physicists and mathematicians, to discuss the latest results in the theory of matrix models and its applications. The book follows this line: it is divided roughly in half between physics and mathematics. The papers by physicists (G. Cicuta; Ph. Di Francesco; V. Kazakov; G. Mahoux, M. Mehta, J.-M. Normand; P. Zinn-Justin) give an overview of different physical problems in which the random matrix theory plays a decisive role, along with a rich variety of methods and ideas used to solve the problems. This includes enumeration of Feynman graphs on Riemann surfaces in the context of two-dimensional quantum gravity, spin systems on random surfaces, “meander problem” and random foldings, enumeration of knots and links, phase transitions and critical phenomena in random matrix models, interacting matrix models, etc.
The purpose of this article is to survey recent interactions between statistical questions and integrable theory. Two types of questions will be tackled here:
(i) Consider a random ensemble of matrices, with certain symmetry conditions to guarantee the reality of the spectrum and subjected to a given statistics. What is the probability that all its eigenvalues belong to a given subset E? What happens, when the size of the matrices gets very large? The probabilities here are functions of the boundary points Ciof E.
(ii) What is the statistics of the length of the largest increasing sequence in a random permutation, assuming each permutation is equally probable? Here, one considers generating functions (over the size of the permutations) for the probability distributions, depending on the variable x.
The main emphasis of this article is to show that integrable theory serves as a useful tool for finding equations satisfied by these functions of x, and conversely the probabilities point the way to new integrable systems.
These questions are all related to integrals over spaces of matrices. Such spaces can be classical Lie groups or algebras, symmetric spaces or their tangent spaces. In infinite-dimensional situations, the “ ∞ -fold” integrals get replaced by Fredholm determinants.
During the last decade, astonishing discoveries have been made in a variety of directions. A first striking feature is that these probabilities are all related to Painleve equations or interesting generalizations. In this way, new and unusual distributions have entered the statistical world.
Selecting N random points in a unit square corresponds to selecting a random permutation. Placing symmetry restrictions on the points, we obtain special kinds of permutations: involutions, signed permutations and signed involutions. We are interested in the statistics of the length (in numbers of points) of the longest up/right path in each symmetry type as the number of points increases to infinity. The limiting distribution functions are expressed in terms of a Painleve II equation. In addition to the Tracy-Widom distributions of random matrix theory, we also obtain two new classes of distribution functions interpolating between the GOE and GSE, and between the GUE and GOE2 Tracy-Widom distribution functions. Applications to random vicious walks and site percolation are also discussed
1. Introduction
Suppose that we are selecting n points, p1 , p2 , … , pn , at random in a rectangle, say R = [0,1] x [0,1] (see Figure 1). We denote by πthe configuration of n random points. With probability 1, no two points have same x -coordinates nor -coordinates. An up/right path of π is a collection of points pi1, pi2, … ,pik such that x(pil) < x(pi2) < • • • < x(pik) and y(pi1)< y(pi2) < • • • < y (pik). The length of such a path is defined by the number of the points in the path. Now we denote by ln(π) the length of the longest up/right path of a random points configuration π.
An integral over the angular variables for two coupled nxn real symmetric, complex hermitian or quaternion self-dual matrices is expressed in terms of the eigenvalues and eigenfunctions of a hamiltonian closely related to the Calogero hamiltonian. This generalizes the known result for the complex hermitian matrices. The integral can thus be evaluated for n = 2 and reduced to a single sum for n = 3.
1. Introduction
The remarkable and useful formula has been known for the last two decades; see [Itzykson and Zuber 1980; Mehta 1981; Mehta 1991, Appendix A.5]. Here A and A’ are nxn complex hermitian matrices having eigenvalues x := ﹛x1,…,xn﹜ and respectively, integration is over the n×n complex unitary matrices U with the invariant Haar measure dU normalized such that. The function △(x) is the product of differences of the Xj:
We would like to have a similar formula when A and A’ are n×n real symmetric or quaternion self-dual matrices and the integration is over n×n real orthogonal or quaternion symplectic matrices U, a formula not presently known. These three cases are usually denoted by a parameter (3 taking values 1, 2 and 4 corresponding respectively to the integration over n x n real orthogonal, complex unitary and quaternion symplectic matrices U. We will show that the integral in (1-1) with a measure dU invariant under the appropriate group can be expressed in terms of the eigenvalues and eigenfunctions of a particular hamiltonian. This hamiltonian is closely related to the Calogero model [1969a; 1969b; 1971] where one considers the quantum n-body problem with the hamiltonian.
We provide a representation-theoretic derivation of the determinantal formula of Borodin and Olshanski for the correlation functions of z-measures in terms of the hypergeometric kernel.
1. Introduction
This paper is about z-measures, a remarkable two-parameter family of measures on partitions introduced by S. Kerov, G. Olshanski and A. Vershik [Kerov et al. 1993] in the context of harmonic analysis on the infinite symmetric group. In a series of papers, A. Borodin and Olshanski obtained fundamental results on z-measures; see the survey [Borodin and Olshanski 2001] in this volume and also [Borodin and Olshanski 1998]. The culmination of this development is an exact determinantal formula for the correlation functions of the z-measures in terms of the hypergeometric kernel [Borodin and Olshanski 2000]. We mention [Borodin et al. 2000] as one of the applications of this formula. The main result of this paper is a representation-theoretic derivation of the formula of Borodin and Olshanski.
In the early days of z-measures, it was already noticed that they have some mysterious connection to the representation theory of SL(2). For example, a z-measure is in fact positive if its two parameters z and z’ are either complex conjugate z' = z or z,z' ∈ (n, n+1) for some n ∈ ℤ. In these cases z — z' is either imaginary or lies in (—1,1), which is reminiscent of the principal and complementary series of representations of SL(2).
Later, Kerov (private communication) constructed an SL(2)-action on partitions for which the z-measures are certain matrix elements.
Hankel determinants which occur in problems associated with orthogonal polynomials, integrable systems and random matrices are computed asymptotically for weights that are supported in an semi-infinite or infinite interval. The main idea is to turn the determinant computation into a random matrix “linear statistics” type problem where the Coulomb fluid approach can be applied.
1. Introduction Let w be a weight function supported on L (a subset of ℝ) that has finite moments of all orders
With w(x) we associate the Hankel matrix, where i, j = 0 , … , n—1. The purpose of this paper is the determination of
for large n with suitable conditions on w. If L is a single interval, say [—1,1], then the asymptotic form of such determinants was computed by Szego [1918] and later by Hirschmann [1966] for quite general w.
Our main result is as follows. Suppose we replace w(x) by a function given in the form wo(x)U(x) where w0(x) is the weight e-xxv. Then for appropriate functions w, the determinants are given asymptotically as n → ∞ by
and G is the Barnes function (see Section 2).
In Section 2 we establish an identity relating Dn[w], Dn[wo], and a certain Predholm determinant and a description of the Predholm determinant from a “linear statistics” point of view. A computation of Dn[wo]is also included. Then in Section 3 the Coulomb fluid approach is used to compute the asymptotics of the Predholm determinant. This, along with the computation of Dn[wo] allows us to give a heuristic, Coulomb fluid derivation of the formula.
Fix q and let Mn be an n × n matrix with entries drawn independently from the finite field Fq according to some distribution μn. It is shown that, except in certain pathological cases, the probability that Mn is nonsingular is asymptotically the same as for uniform entries; that is,
It has been conjectured by Alspach [2] that given integers n and m1, …, mt with 3 [les ] mi [les ] n and [sum ]ti=1mi = (n2) (n odd) or [sum ]ti=1mi = (n2) − n/2 (n even), then one can pack Kn (n odd) or Kn minus a 1-factor (n even) with cycles of lengths m1, …, mt. In this paper we show that if the cycle lengths mi are bounded by some linear function of n and n is sufficiently large then this conjecture is true.
We show that connected matroids with symmetric Tutte polynomials are not necessarily self-dual; in fact, we construct matroids that are not self-dual, have arbitrarily high connectivity, and yet have symmetric Tutte polynomials.
A graph Γ with diameter d is strongly distance-regular if Γ is distance-regular and its distance-d graph Γd is strongly regular. Some known examples of such graphs are the connected strongly regular graphs, with distance-d graph Γd = Γ (the complement of Γ), and the antipodal distance-regular graphs. Here we study some spectral conditions for a (regular or distance-regular) graph to be strongly distance-regular. In particular, for the case d = 3 the following characterization is proved. A regular (connected) graph Γ, with distinct eigenvalues λ0 > λ1 > λ2 > λ3, is strongly distance-regular if and only if λ2 = −1, and Γ3 is k-regular with degree k satisfying an expression which depends only on the order and the different eigenvalues of Γ.
In 1978, Dhar suggested a model of a lattice gas whose states are partial orders. In this context he raised the question of determining the number of partial orders with a fixed number of comparable pairs. Dhar conjectured that in order to find a good approximation to this number, it should suffice to enumerate families of layer posets. In this paper we prove this conjecture and thereby prepare the ground for a complete answer to the question.
We present versions of concentration inequalities for products of Markov kernels and graph products. We also present discussions of a variety of consequences such as sharp upper bounds, in terms of the diameter of the state space, on the spectral gap.
Simulated annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of simulated annealing to the 3-colouring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected first hitting time of a proper colouring, given an arbitrary cooling scheme, is of exponential size.
These results are complementary to those in [13], where we prove the convergence of simulated annealing to an optimal solution in exponential time.
Fix a small graph H and let YH denote the number of copies of H in the random graph G(n, p). We investigate the degree of concentration of YH around its mean, motivated by the following questions.
[bull] What is the upper tail probability Pr(YH [ges ] (1 + ε)[](YH))?
[bull] For which λ does YH have sub-Gaussian behaviour, namely
(formula here)
where c is a positive constant?
[bull] Fixing λ = ω(1) in advance, find a reasonably small tail T = T(λ) such that
(formula here)
We prove a general concentration result which contains a partial answer to each of these questions. The heart of the proof is a new martingale inequality, due to J. H. Kim and the present author [13].
We show that there exist universal constants C(r) < ∞ such that, for all loopless graphs G of maximum degree [les ] r, the zeros (real or complex) of the chromatic polynomial PG(q) lie in the disc [mid ]q[mid ] < C(r). Furthermore, C(r) [les ] 7.963907r. This result is a corollary of a more general result on the zeros of the Potts-model partition function ZG(q, {ve}) in the complex antiferromagnetic regime [mid ]1 + ve[mid ] [les ] 1. The proof is based on a transformation of the Whitney–Tutte–Fortuin–Kasteleyn representation of ZG(q, {ve}) to a polymer gas, followed by verification of the Dobrushin–Kotecký–Preiss condition for nonvanishing of a polymer-model partition function. We also show that, for all loopless graphs G of second-largest degree [les ] r, the zeros of PG(q) lie in the disc [mid ]q[mid ] < C(r) + 1. Along the way, I give a simple proof of a generalized (multivariate) Brown–Colbourn conjecture on the zeros of the reliability polynomial for the special case of series-parallel graphs.
This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give optimal layouts for the problems still open. For arbitrary lattice graphs, we present best possible bounds disregarding a constant factor. We apply percolation theory to the study of lattice graphs in a probabilistic setting. In particular, we deal with the subcritical regime that this class of graphs exhibits and characterize the behaviour of several layout measures in this space of probability. We extend the results on random lattice graphs to random geometric graphs, which are graphs whose nodes are spread at random in the unit square and whose edges connect pairs of points which are within a given distance. We also characterize the behaviour of several layout measures on random geometric graphs in their subcritical regime. Our main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.
Let G be an abelian group. For a subset A ⊂ G, denote by 2 ∧ A the set of sums of two different elements of A. A conjecture by Erdős and Heilbronn, first proved by Dias da Silva and Hamidoune, states that, when G has prime order, [mid ]2 ∧ A[mid ] [ges ] min([mid ]G[mid ], 2[mid ]A[mid ] − 3).
We prove that, for abelian groups of odd order (respectively, cyclic groups), the inequality [mid ]2 ∧ A[mid ] [ges ] min([mid ]G[mid ], 3[mid ]A[mid ]/2) holds when A is a generating set of G, 0 ∈ A and [mid ]A[mid ] [ges ] 21 (respectively, [mid ]A[mid ] [ges ] 33). The structure of the sets for which equality holds is also determined.