Corpus ID: 55827434

Spectral gap in random bipartite biregular graphs and applications

  title={Spectral gap in random bipartite biregular graphs and applications},
  author={Gerandy Brito and Ioana Dumitriu and K. D. Harris},
  journal={arXiv: Probability},
We prove an analogue of Alon's spectral gap conjecture for random bipartite, biregular graphs. We use the Ihara-Bass formula to connect the non-backtracking spectrum to that of the adjacency matrix, employing the moment method to show there exists a spectral gap for the non-backtracking matrix. Finally, we give some applications in machine learning and coding theory. 

Figures from this paper

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,Expand
Existence and polynomial time construction of biregular, bipartite Ramanujan graphs of all degrees
We prove that there exist bipartite, biregular Ramanujan graphs of every degree and every number of vertices provided that the cardinalities of the two sets of the bipartition divide each other. ThisExpand
Spectra of random regular hypergraphs
In this paper, we study the spectra of regular hypergraphs following the definitions from Feng and Li (1996). Our main result is an analog of Alon's conjecture for the spectral gap of the randomExpand
Ramanujan Graphs and Digraphs
Ramanujan graphs have fascinating properties and history. In this paper we explore a parallel notion of Ramanujan digraphs, collecting relevant results from old and recent papers, and proving someExpand
The spectral gap of sparse random digraphs
The second largest eigenvalue of a transition matrix $P$ has connections with many properties of the underlying Markov chain, and especially its convergence rate towards the stationary distribution.Expand
Algorithms for #BIS-hard problems on expander graphs
An FPTAS and an efficient sampling algorithm are given and efficient counting and sampling algorithms are found for proper $q$-colorings of random $\Delta$-regular bipartite graphs when q is sufficiently small as a function of $\Delta$. Expand
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 thatExpand
Abstract. Let G be a directed Erdős-Rényi graph in the very sparse regime where the mean number of neighbors d is fixed or slowly growing to 8. A weight Px,y is put on any edge px, yq present in theExpand
Lower Bounds for Symmetric Circuits for the Determinant
A general framework for proving lower bounds for symmetric circuits with restricted symmetries with a new support theorem and new two-player restricted bijection games is developed, applied to the determinant problem with a novel construction of matrices that are biadjacency matrices of graphs based on the CFI construction. Expand
Ramanujan complexes and Golden Gates in PU(3)
In a seminal series of papers from the 80's, Lubotzky, Phillips and Sarnak applied the Ramanujan Conjecture for $GL_{2}$ (Deligne's theorem), to a special arithmetic lattice, which actsExpand


The Marčenko-Pastur law for sparse random bipartite biregular graphs
We prove that the empirical spectral distribution of a dL, dR-biregular, bipartite random graph, under certain conditions, converges to a symmetrization of the Marcenko-Pastur distribution of randomExpand
The semicircle law for semiregular bipartite graphs
Two analogs of the semicircle law for the distribution of eigenvalues of specified regular subgraphs of semiregular bipartite graphs are presented. Expand
Resolvent of large random graphs
The convergence of the spectrum of large random graphs to the Spectrum of a limit infinite graph is analyzed and a new formula for the Stieljes transform of the spectral measure of such graphs is derived. Expand
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees
The existence of infinite families of (c, d)-biregular bipartite graphs with all non-trivial eigenvalues bounded by √c-1+√d-1, for all c, d ≥ q 3 is proved. Expand
Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials
The distribution of eigenvalues of regular graphs, regular hypergraphs, and biregular bipartite graphs of given girth is studied by considering the polynomials orthogonal with respect to the measures attached to theSpectra of such graphs and to the continuous spectra of their ‘universal covers’. Expand
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs
This work studies the largest eigen valus of the non-backtracking matrix of the Erdos-Renyi random graph and of the Stochastic Block Model in the regime where the number of edges is proportional to the numberof vertices. Expand
The spectral gap of sparse random digraphs
The second largest eigenvalue of a transition matrix $P$ has connections with many properties of the underlying Markov chain, and especially its convergence rate towards the stationary distribution.Expand
A new proof of Friedman's second eigenvalue Theorem and its extension to random lifts
It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivialExpand
Zeta Functions of Finite Graphs
Poles of the Ihara zeta function associated with a fi- nite graph are described by graph-theoretic quantities. Elementary proofs based on the notions of oriented line graphs, Perron-FrobeniusExpand
Spectra of Hypergraphs and Applications
Abstract To a regular hypergraph we attach an operator, called its adjacency matrix, and study the second largest eigenvalue as well as the overall distribution of the spectrum of this operator. OurExpand