Article

Cycles and eigenvalues of sequentially growing random regular graphs

The Annals of Probability (Impact Factor: 1.43). 03/2012; DOI: 10.1214/13-AOP864
Source: arXiv

ABSTRACT Consider the sum of d many iid random permutation matrices on n labels along
with their transposes. The resulting matrix is the adjacency matrix of a random
regular (multi)-graph of degree 2d on n vertices. It is known that the
distribution of smooth linear eigenvalue statistics of this matrix is given
asymptotically by sums of Poisson random variables. This is in contrast with
Gaussian fluctuation of similar quantities in the case of Wigner matrices. It
is also known that for Wigner matrices the joint fluctuation of linear
eigenvalue statistics across minors of growing sizes can be expressed in terms
of the Gaussian Free Field (GFF). In this article we explore joint asymptotic
(in n) fluctuation for a coupling of all random regular graphs of various
degrees obtained by growing each component permutation according to the Chinese
Restaurant Process. Our primary result is that the corresponding eigenvalue
statistics can be expressed in terms of a family of independent Yule processes
with immigration. These processes track the evolution of short cycles in the
graph. If we now take d to infinity certain GFF-like properties emerge.

0 Bookmarks
 · 
81 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We develop a general theory of intertwined diffusion processes of any dimension. Our main result gives an SDE characterization of all possible intertwinings of diffusion processes and shows that they correspond to nonnegative solutions of hyperbolic partial differential equations. For example, solutions of the classical wave equation correspond to the intertwinings of two Brownian motions. The theory allows us to unify many older examples of intertwinings, such as the process extension of the beta-gamma algebra, with more recent examples such as the ones arising in the study of two-dimensional growth models. We also find many new classes of intertwinings and develop systematic procedures for building more complex intertwinings by combining simpler ones. In particular, `orthogonal waves' combine unidimensional intertwinings to produce multidimensional ones. Connections with duality, time reversals and Doob's h-transforms are also explored.
    06/2013;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we give an explicit bound in total variation distance for the approximation. Using this result, we calculate limiting distributions of linear eigenvalue functionals for random regular graphs. Previous results on the distribution of cycle counts by McKay, Wormald, and Wysocka (2004) used the method of switchings, a combinatorial technique for asymptotic enumeration. Our proof uses Stein's method of exchangeable pairs and demonstrates an interesting connection between the two techniques.
    12/2011;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We prove that the empirical spectral distribution of a (d_L, d_R)-biregular, bipartite random graph, under certain conditions, converges to a symmetrization of the Mar\v{c}enko-Pastur distribution of random matrix theory. This convergence is not only global (on fixed-length intervals) but also local (on intervals of increasingly smaller length). Our method parallels the one used previously by Dumitriu and Pal (2012).
    Random Structures and Algorithms 04/2013; · 1.05 Impact Factor

Full-text

Download
0 Downloads
Available from