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

From MaRDI portal
Publication:2010629

DOI10.1016/J.JCTA.2019.105134zbMATH Open1428.05203arXiv1810.10934OpenAlexW2975457774WikidataQ127218691 ScholiaQ127218691MaRDI QIDQ2010629FDOQ2010629


Authors: Samir Shukla, D. Yogeshwaran Edit this on Wikidata


Publication date: 27 November 2019

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

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}.


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




Recommendations




Cites Work


Cited In (1)





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)