Invertibility of adjacency matrices for random \(d\)-regular graphs

DOI10.1215/00127094-2021-0006OpenAlexW3214736812MaRDI QIDQ2073284

Jiaoyang Huang

Publication date: 1 February 2022

Published in: Duke Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

random matricessingularity problemrandom \(d\)-regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52)

Related Items

Singularity of sparse Bernoulli matrices, Singularity of the \(k\)-core of a random graph, Spectrum of random d‐regular graphs up to the edge, Critical window of the symmetric perceptron, The circular law for random regular digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacency matrices of random digraphs: singularity and anti-concentration
• Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
• On the singularity of adjacency matrices for random regular digraphs
• Invertibility of sparse non-Hermitian matrices
• The rank of random regular digraphs of constant degree
• Random symmetric matrices are almost surely nonsingular.
• On the singularity probability of discrete random matrices
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Fixed energy universality of Dyson Brownian motion
• The smallest singular value of a shifted $d$-regular random square matrix
• Circular law for the sum of random permutation matrices
• On the singularity of random symmetric matrices
• The circular law for random regular digraphs
• Singularity of random Bernoulli matrices
• The circular law for sparse non-Hermitian matrices
• The Littlewood-Offord problem and invertibility of random matrices
• On the singularity probability of random Bernoulli matrices
• The rank of random graphs
• Smallest singular value of a random rectangular matrix
• Enumeration of Labelled Graphs I: 3-Connected Graphs
• Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
• On the Probability That a Random ± 1-Matrix Is Singular
• The distribution of sandpile groups of random regular graphs
• SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
• Structure of eigenvectors of random regular digraphs
• Invertibility of symmetric random matrices