Discrepancy properties for random regular digraphs

DOI10.1002/rsa.20643zbMath1352.05164arXiv1410.5595OpenAlexW2963121788MaRDI QIDQ2951882

Nicholas A. Cook

Publication date: 10 January 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

concentration of measurerandom regular graphdiscrepancy propertymethod of exchangeable pairs

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

The sparse circular law under minimal assumptions ⋮ The circular law for random regular digraphs with random edge weights ⋮ On the second eigenvalue of random bipartite biregular graphs ⋮ Structure of eigenvectors of random regular digraphs ⋮ The spectral gap of dense random regular graphs ⋮ The smallest singular value of a shifted $d$-regular random square matrix ⋮ Size biased couplings and the spectral gap for random regular graphs ⋮ Circular law for the sum of random permutation matrices ⋮ The circular law for random regular digraphs ⋮ On the counting problem in inverse Littlewood–Offord theory

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Functional limit theorems for random regular graphs
• On the singularity of adjacency matrices for random regular digraphs
• Sparse regular random graphs: spectral density and eigenvectors
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The expected eigenvalue distribution of a large regular graph
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of labeled graphs with given degree sequences
• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
• Asymptotic enumeration by degree sequence of graphs of high degree
• List coloring of random and pseudo-random graphs
• Stein's method for concentration inequalities
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• Random regular graphs of high degree
• Expander graphs and their applications
• Some problems in the enumeration of labelled graphs
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Sparse random graphs: Eigenvalues and eigenvectors
• Quasi-random graphs

This page was built for publication: Discrepancy properties for random regular digraphs