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

- [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; - [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; - [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

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.