Spectral gap bounds for the simplicial Laplacian and an application to random complexes

DOI10.1016/J.JCTA.2019.105134MaRDI QIDQ2010629zbMATH OpenOpenAlexWikidataFDO

Authors Samir Shukla, D. Yogeshwaran

Publication date 27 November 2019

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

cohomologyLaplacianspectral boundsneighborhood complexErdős-Rényi random graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of simplicial complexes (05E45)

Abstract: In this article, we derive two spectral gap bounds for the reduced Laplacian of a general simplicial complex. Our two bounds are proven by comparing a simplicial complex in two different ways with a larger complex and with the corresponding clique complex respectively. Both of these bounds generalize the result of Aharoni et al. (2005) cite{ABM} which is valid only for clique complexes. As an application, we investigate the thresholds for vanishing of cohomology of the neighborhood complex of the Erd"{o}s-R'enyi random graph. We improve the upper bound derived in Kahle (2007) cite{kahle} by a logarithmic factor using our spectral gap bounds and we also improve the lower bound via finer probabilistic estimates than those in Kahle (2007) cite{kahle}.

Recommendations

• Spectral gaps of random graphs and applications
• Eigenvalue confinement and spectral gap for random simplicial complexes
• The spectral gaps of generalized flag complexes and a geometric Hall-type theorem
• Spectral gaps, missing faces and minimal degrees

Cites work

• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• Asymptotic behavior of lifetime sums for random simplicial complex processes
• Computational topology. An introduction
• Eigenvalues and homology of flag complexes and vector representations of graphs
• Introduction to Random Graphs
• Kneser's conjecture, chromatic number, and homotopy
• On \(L^2\)-cohomology and property (T) for automorphism groups of polyhedral cell complexes
• Sharp vanishing thresholds for cohomology of random flag complexes
• The neighborhood complex of a random graph
• Topology of random simplicial complexes: a survey
• p-adic curvature and the cohomology of discrete subgroups of p-adic groups

Cited in

(6)

• Spectral expansion of random sum complexes
• Spectral gaps of random graphs and applications
• Spectral gaps, missing faces and minimal degrees
• The spectral gaps of generalized flag complexes and a geometric Hall-type theorem
• Eigenvalue confinement and spectral gap for random simplicial complexes
• On construction of upper and lower bounds for the HOMO-LUMO spectral gap

This page was built for publication: Spectral gap bounds for the simplicial Laplacian and an application to random complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010629)