The Threshold for Integer Homology in Random d-Complexes
@article{Hoffman2017TheTF,
title={The Threshold for Integer Homology in Random d-Complexes},
author={C. Hoffman and M. Kahle and E. Paquette},
journal={Discrete & Computational Geometry},
year={2017},
volume={57},
pages={810-823}
}Let $$Y \sim Y_d(n,p)$$Y∼Yd(n,p) denote the Bernoulli random d-dimensional simplicial complex. We answer a question of Linial and Meshulam from 2003, showing that the threshold for vanishing of homology $$H_{d-1}(Y; \mathbb {Z})$$Hd-1(Y;Z) is less than $$40d (d+1) \log n / n$$40d(d+1)logn/n. This bound is tight, up to a constant factor which depends on d.
Topics from this paper.
22 Citations
Small Simplicial Complexes with Prescribed Torsion in Homology
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2019
- 6
- Highly Influenced
- PDF
Eigenvalue confinement and spectral gap for random simplicial complexes
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2017
- 4
- PDF
Vanishing of cohomology groups of random simplicial complexes
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2020
- 4
Integral Homology of Random Simplicial Complexes
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2018
- 16
- Highly Influenced
- PDF
The threshold for d-collapsibility in random complexes
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2016
- 17
- PDF
Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2017
- 20
- PDF
References
SHOWING 1-10 OF 20 REFERENCES
Homological connectivity of random k-dimensional complexes
- Mathematics, Computer Science
- Random Struct. Algorithms
- 2009
- 121
- PDF
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2013
- 68
- PDF
Homological Connectivity Of Random 2-Complexes
- Computer Science, Mathematics
- Comb.
- 2006
- 214
- Highly Influential
- PDF