Invertibility of adjacency matrices for random d-regular graphs
math.PR, math.CO
Submitted: 2018-07-16
Updated: 2018-12-30
Terminology
Sources
- The circular law for sparse non-Hermitian matrices
- The circular law for random regular digraphs
- Fixed energy universality for Dyson Brownian motion
- The smallest singular value of a shifted $d$-regular random square matrix
- The rank of random regular digraphs of constant degree
- Structure of eigenvectors of random regular digraphs
- The distribution of sandpile groups of random regular graphs
- Cokernels of adjacency matrices of random $r$-regular graphs
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves
- A zero-one law for swap-invariant events in uniform spanning forests
- Bernoulli flow for Erd s-R'enyi graphs