Vanishing of cohomology groups of random simplicial complexes
Random Structures & Algorithms · 2020-03 · 56 (2) · 461-500
DOI: 10.1002/rsa.20857 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 23.04.2019. Verfasst von Oliver Cooley und 3 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 42 Literaturangaben. Gefördert von: Austrian Science Fund, Deutsche Forschungsgemeinschaft.
Abstract (Originalsprache)
We consider k ‐dimensional random simplicial complexes generated from the binomial random ( k + 1)‐uniform hypergraph by taking the downward‐closure. For 1 ≤ j ≤ k − 1, we determine when all cohomology groups with coefficients in from dimension one up to j vanish and the zero‐th cohomology group is isomorphic to . This property is not deterministically monotone for this model, but nevertheless we show that it has a single sharp threshold. Moreover we prove a hitting time result, relating the vanishing of these cohomology groups to the disappearance of the last minimal obstruction. We also study the asymptotic distribution of the dimension of the j ‐th cohomology group inside the critical window. As a corollary, we deduce a hitting time result for a different model of random simplicial complexes introduced by Linial and Meshulam, previously only known for dimension two.
Förderung
- Austrian Science Fund
- Deutsche Forschungsgemeinschaft
Zitieren
APA
Cooley, O., Giudice, N. D., Kang, M., & Sprüssel, P. (2020). Vanishing of cohomology groups of random simplicial complexes. Random Structures & Algorithms, 56(2), 461-500. https://doi.org/10.1002/rsa.20857
Vancouver
Cooley O, Giudice ND, Kang M, Sprüssel P. Vanishing of cohomology groups of random simplicial complexes. Random Structures & Algorithms. 2020;56(2):461-500. doi:10.1002/rsa.20857
BibTeX
@article{Cooley2020,
author = {Cooley, Oliver and Giudice, Nicola Del and Kang, Mihyun and Sprüssel, Philipp},
title = {Vanishing of cohomology groups of random simplicial complexes},
journal = {Random Structures & Algorithms},
year = {2020},
volume = {56},
number = {2},
pages = {461--500},
doi = {10.1002/rsa.20857}
}
EUVIMED