On the second eigenvalue of random bipartite biregular graphs

DOI10.1007/s10959-022-01190-0arXiv2005.08103MaRDI QIDQ6161614

Yizhe Zhu

Publication date: 5 June 2023

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

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

zbMATH Keywords

spectral gapswitchingsize biased couplingrandom bipartite biregular graph

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacency matrices of random digraphs: singularity and anti-concentration
• Functional limit theorems for random regular graphs
• On the singularity of adjacency matrices for random regular digraphs
• Spectra of lifted Ramanujan graphs
• Bulk eigenvalue statistics for random regular graphs
• Concentration of measures via size-biased couplings
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Small subgraphs of random regular graphs
• Eigenvalues and expanders
• The expected eigenvalue distribution of a large regular graph
• On the second eigenvalue of a graph
• 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
• Size bias for one and all
• Short cycles in random regular graphs
• On the second eigenvalue of hypergraphs
• Spectra of regular graphs and hypergraphs and orthogonal polynomials
• Spectra of hypergraphs and applications
• The spectral gap of sparse random digraphs
• Sparse random tensors: concentration, regularization and applications
• Edge rigidity and universality of random regular graphs of intermediate degree
• Exchangeable pairs, switchings, and random regular graphs
• The circular law for random regular digraphs
• Consistency of spectral clustering in stochastic block models
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• The spectral gap of random graphs with given expected degrees
• Local Kesten-McKay law for random regular graphs
• Circular law for sparse random regular digraphs
• Random regular graphs of high degree
• Discrepancy properties for random regular digraphs
• Expander codes
• Expander graphs and their applications
• A proof of Alon’s second eigenvalue conjecture and related problems
• A recursive approach to low complexity codes
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery
• Matrix Completion From a Few Entries
• Spectral techniques applied to sparse random graphs
• Local Semicircle Law for Random Regular Graphs
• Structure of eigenvectors of random regular digraphs
• Spectral gap in random bipartite biregular graphs and applications

This page was built for publication: On the second eigenvalue of random bipartite biregular graphs