• Corpus ID: 218673816

On the second eigenvalue of random bipartite biregular graphs

  title={On the second eigenvalue of random bipartite biregular graphs},
  author={Yizhe Zhu},
  journal={arXiv: Probability},
  • Yizhe Zhu
  • Published 16 May 2020
  • Mathematics
  • arXiv: Probability
We consider the spectral gap of a uniformly chosen random $(d_1,d_2)$-biregular bipartite graph $G$ with $|V_1|=n, |V_2|=m$, where $d_1,d_2$ could possibly grow with $n$ and $m$. Let $A$ be the adjacency matrix of $G$. Under the assumption that $d_1\geq d_2$ and $d_2=O(n^{2/3}),$ we show that $\lambda_2(A)=O(\sqrt{d_1})$ with high probability. As a corollary, combining the results from Tikhomirov and Youssef (2019), we confirm a conjecture in Cook (2017) that the second singular value of a… 

Figures from this paper

On the eigenvalues of Erdos-Renyi random bipartite graphs
We analyse the eigenvalues of Erdös–Rényi random bipartite graphs. In particular, we consider p satisfying n1p = Ω( √ n1p log 3(n1)), n2p = Ω( √ n2p log 3(n2)), and let G ∼ G(n1, n2, p). We show that
Global eigenvalue fluctuations of random biregular bipartite graphs
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof,
Sparse matrices: convergence of the characteristic polynomial seen from infinity
We prove that the reverse characteristic polynomial det(In − zAn) of a random n×nmatrixAn with iidBernoulli(d/n) entries converges in distribution towards the random infinite product ∞ ∏ `=1 (1− z)`
$\ell_p$-Spread and Restricted Isometry Properties of Sparse Random Matrices
Random subspaces of R= of dimension proportional to = are, with high probability, wellspread with respect to the l2-norm. Namely, every nonzero G ∈ is “robustly non-sparse” in the following sense: G
Concentration inequalities from monotone couplings for graphs, walks, trees and branching processes
. Generalized gamma distributions arise as limits in many settings involving random graphs, walks, trees, and branching processes. Pek¨oz, R¨ollin, and Ross (2016) ex- ploited characterizing
The characteristic polynomial of sums of random permutations and regular digraphs
. Let A n be the sum of d permutations matrices of size n × n , each drawn uniformly at random and indepen-dently. We prove that det(I n − zA n / √ d ) converges when n → ∞ towards a random analytic
Sparse random tensors: Concentration, regularization and applications
A non-asymptotic concentration inequality of sparse inhomogeneous random tensors under the spectral norm is proved and a simple way to regularize T such that concentration still holds down to sparsity is provided.


Structure of eigenvectors of random regular digraphs
Let $n$ be a large integer, let $d$ satisfy $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in {\mathcal C}$. Further, denote by $M$ the adjacency matrix of a
The spectral gap of dense random regular graphs
For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular
Circular law for sparse random regular digraphs
Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices.
On the singularity of adjacency matrices for random regular digraphs
We prove that the (non-symmetric) adjacency matrix of a uniform random d-regular directed graph on n vertices is asymptotically almost surely invertible, assuming $$\min (d,n-d)\ge C\log
Spectral Gaps of Random Graphs and Applications
We study the spectral gap of the Erdős–Rényi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta> 0$ if $$\begin{equation*} p \geq \frac{(1/2 +
The smallest singular value of a shifted d-regular random square matrix
We derive a lower bound on the smallest singular value of a random d-regular matrix, that is, the adjacency matrix of a random d-regular directed graph. Specifically, let $$C_1<d< c n/\log ^2
Functional limit theorems for random regular graphs
Consider $$d$$ uniformly random permutation matrices on $$n$$ labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random
The Spectral Gap of Random Graphs with Given Expected Degrees
The main result is that w.h.p. G(n,d) has a large subgraph core(G(n),d) such that the spectral gap of the normalized Laplacian of core(N,d)) is $\geq1-c_0{\bar d}_{\min}^{-1/2}$ with high probability; here c0>0 is a constant, and ${\bar d}.
Optimal construction of edge-disjoint paths in random graphs
The results give the first tight bounds for the edge-disjoint paths problem for any nontrivial class of graphs.