Loose laplacian spectra of random hypergraphs
From MaRDI portal
Publication:3145841
DOI10.1002/rsa.20443zbMath1255.05116arXiv1109.3433OpenAlexW2030214687MaRDI QIDQ3145841
Publication date: 14 December 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3433
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Connected hypergraphs with small spectral radius, Community detection in the sparse hypergraph stochastic block model, Global eigenvalue fluctuations of random biregular bipartite graphs, On the spectra of general random mixed graphs, On eigenvalues of random complexes, On the first and second eigenvalue of finite and infinite uniform hypergraphs, Hitting times, commute times, and cover times for random walks on random hypergraphs, Sparse random tensors: concentration, regularization and applications, Spectra of random regular hypergraphs, Adjacency spectra of random and complete hypergraphs, Exact recovery in the hypergraph stochastic block model: a spectral algorithm, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
Cites Work
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- On the spectra of general random graphs
- The diameter and Laplacian eigenvalues of directed graphs
- Laplacian eigenvalues and partition problems in hypergraphs
- A note on an inequality involving the normal distribution
- The eigenvalues of random symmetric matrices
- On the second eigenvalue and random walks in random \(d\)-regular graphs
- Eigenvalues of random power law graphs
- Laplacians and the Cheeger inequality for directed graphs
- On the concentration of eigenvalues of random symmetric matrices
- The spectral gap of random graphs with given expected degrees
- A simple proof of the Erdős-Chao Ko-Rado theorem
- High-Ordered Random Walks and Generalized Laplacians on Hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Diameters and Eigenvalues
- Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- On the Laplacian Spectrum and Walk-regular Hypergraphs
- Cauchy's Interlace Theorem for Eigenvalues of Hermitian Matrices
- Strong converse for identification via quantum channels
- The Largest Eigenvalue of Sparse Random Graphs
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Spectral techniques applied to sparse random graphs
- A Simpler Approach to Matrix Completion
- On the Laplacian Eigenvalues of Gn,p
- Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
- Spectra of random graphs with given expected degrees
