Structure of eigenvectors of random regular digraphs
From MaRDI portal
Publication:5380492
DOI10.1090/tran/7742zbMath1447.05091arXiv1801.05575OpenAlexW2963428250WikidataQ128972184 ScholiaQ128972184MaRDI QIDQ5380492
Anna Lytova, Nicole Tomczak-Jaegermann, Pierre Youssef, Konstantin Tikhomirov, Alexander E. Litvak
Publication date: 5 June 2019
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.05575
random matricesrandom graphssparse matricesregular graphsLittlewood-Offord theorydelocalization of eigenvectorsstructure of kernel
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Probabilistic methods in Banach space theory (46B09) Random matrices (algebraic aspects) (15B52) Directed graphs (digraphs), tournaments (05C20) Asymptotic theory of Banach spaces (46B06)
Related Items
Singularity of sparse Bernoulli matrices, Circular law for sparse random regular digraphs, On delocalization of eigenvectors of random non-Hermitian matrices, The sparse circular law under minimal assumptions, Singularity of the \(k\)-core of a random graph, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Past, current and future trends and challenges in non-deterministic fracture mechanics: a review, Quantitative invertibility of non-Hermitian random matrices, On the second eigenvalue of random bipartite biregular graphs, Spectral gap of sparse bistochastic matrices with exchangeable rows, Eigenvectors and controllability of non-Hermitian random matrices and directed graphs, Invertibility of adjacency matrices for random \(d\)-regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Adjacency matrices of random digraphs: singularity and anti-concentration
- Functional limit theorems for random regular graphs
- Around the circular law
- Expansion of random graphs: new proofs, new results
- On the singularity of adjacency matrices for random regular digraphs
- Anti-concentration property for random digraphs and invertibility of their adjacency matrices
- Invertibility of sparse non-Hermitian matrices
- Sparse regular random graphs: spectral density and eigenvectors
- The rank of random regular digraphs of constant degree
- No-gaps delocalization for general random matrices
- Large deviations of empirical neighborhood distribution in sparse random graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Delocalization of eigenvectors of random matrices with independent entries
- Convergence of the density of states and delocalization of eigenvectors on random regular graphs
- The circular law for random matrices
- Spectral analysis of large dimensional random matrices
- The expected eigenvalue distribution of a large regular graph
- Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries
- 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
- Quantum ergodicity on large regular graphs
- Invertibility of random matrices: norm of the inverse
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Eigenvector statistics of sparse random matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Smallest singular value of random matrices and geometry of random polytopes
- Discrepancy properties for random regular digraphs
- Bounds for the Multidimensional Lévy Concentration Function
- Non-asymptotic theory of random matrices: extreme singular values
- Symmetric Random Walks on Groups
- On the singularity probability of random Bernoulli matrices
- Expander graphs and their applications
- A proof of Alon’s second eigenvalue conjecture and related problems
- RANDOM MATRICES: THE CIRCULAR LAW
- Smallest singular value of a random rectangular matrix
- Estimates for the concentration function of combinatorial number theory and probability
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- On the Probability That a Random ± 1-Matrix Is Singular
- Smallest singular value of sparse random matrices
- Sparse random graphs: Eigenvalues and eigenvectors
- Probability Inequalities for Sums of Bounded Random Variables
- Local Semicircle Law for Random Regular Graphs
- On the Kolmogorov-Rogozin inequality for the concentration function
- On the concentration function of a sum of independent random variables
- A Sharper Form of the Doeblin-Lévy-Kolmogorov-Rogozin Inequality for Concentration Functions.
- On the distribution of additive arithmetic functions
