Exchangeable pairs, switchings, and random regular graphs

zbMath1307.05205arXiv1112.0704MaRDI QIDQ2256130

Tobias Johnson

Publication date: 19 February 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0704

zbMATH Keywords

Stein's methodrandom regular graphsswitchingslinear eigenvalue statisticsexchangeable pairs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Convergence of probability measures (60B10)

Related Items

Global eigenvalue fluctuations of random biregular bipartite graphs, Local Kesten-McKay law for random regular graphs, Spectrum of random d‐regular graphs up to the edge, On the second eigenvalue of random bipartite biregular graphs, Edge rigidity and universality of random regular graphs of intermediate degree, CLT for circular beta-ensembles at high temperature, Size biased couplings and the spectral gap for random regular graphs, A random walk approach to linear statistics in random tournament ensembles, The Marčenko-Pastur law for sparse random bipartite biregular graphs, Imaginary replica analysis of loopy regular random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional limit theorems for random regular graphs
• Cycles and eigenvalues of sequentially growing random regular graphs
• Fundamentals of Stein's method
• Sparse regular random graphs: spectral density and eigenvectors
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• On the convergence of the spectral empirical process of Wigner matrices
• Small subgraphs of random regular graphs
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• Exchangeable pairs and Poisson approximation
• Spectral analysis of large dimensional random matrices
• Random regular graphs of non-constant degree: concentration of the chromatic number
• Asymptotic evaluation of the number of latin rectangles
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The expected eigenvalue distribution of a large regular graph
• Poisson approximation for dependent trials
• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
• Short cycles in random regular graphs
• Algebraic algorithms for sampling from conditional distributions
• On fluctuations of eigenvalues of random permutation matrices
• Stein's method for concentration inequalities
• Random regular graphs of high degree
• Permutation Pseudographs and Contiguity
• A proof of Alon’s second eigenvalue conjecture and related problems
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• Central limit theorem for traces of large random symmetric matrices with independent matrix elements
• Sparse random graphs: Eigenvalues and eigenvectors
• Asymptotic enumeration of Latin rectangles