Skip to main content
Log in

The Threshold for Integer Homology in Random d-Complexes

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

Let \(Y \sim Y_d(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})\) is less than \(40d (d+1) \log n / n\). This bound is tight, up to a constant factor which depends on d.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aronshtam, L., Linial, N., Łuczak, T., Meshulam, R.: Collapsibility and vanishing of top homology in random simplicial complexes. Discrete Comput. Geom. 49(2), 317–334 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ballmann, W., Świątkowski, J.: On \(L^2\)-cohomology and property (T) for automorphism groups of polyhedral cell complexes. Geom. Funct. Anal. 7(4), 615–645 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Björner, A.: Topological methods. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. 2, pp. 1819–1872. Elsevier, Amsterdam (1995)

    Google Scholar 

  4. Cohen, D., Costa, A., Farber, M., Kappeler, T.: Topology of random 2-complexes. Discrete Comput. Geom. 47(1), 117–149 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Friedgut, E.: Sharp thresholds of graph properties, and the \(k\)-sat problem. J. Am. Math. Soc. 12(4), 1017–1054 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Garland, H.: \(p\)-adic curvature and the cohomology of discrete subgroups of \(p\)-adic groups. Ann. Math. 97(3), 375–423 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hoffman, C., Kahle, M., Paquette, E.: Spectral gaps of random graphs and applications to random topology. arXiv:1201.0425 (2012) (submitted)

  8. Janson, S., Łuczak, T., Rucinski, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000)

  9. Kalai, G.: Enumeration of \({ Q}\)-acyclic simplicial complexes. Isr. J. Math. 45(4), 337–351 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kahle, M.: Sharp vanishing threshold for cohomology of random flag complexes. Ann. Math. 179(3), 1085–1107 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Linial, N., Meshulam, R.: Homological connectivity of random 2-complexes. Combinatorica 26(4), 475–487 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Meshulam, R., Wallach, N.: Homological connectivity of random \(k\)-dimensional complexes. Random Struct. Algorithms 34(3), 408–417 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Soulé, C.: Perfect forms and the Vandiver conjecture. J. Reine Angew. Math. 517, 209–221 (1999)

    MathSciNet  MATH  Google Scholar 

  14. Żuk, A.: La propriété (T) de Kazhdan pour les groupes agissant sur les polyèdres. C. R. Acad. Sci. Paris Sér. I Math. 323(5), 453–458 (1996)

    MathSciNet  MATH  Google Scholar 

  15. Żuk, A.: Property (T) and Kazhdan constants for discrete groups. Geom. Funct. Anal. 13(3), 643–670 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors thank Nati Linial and Roy Meshulam for many helpful and encouraging conversations. C.H. gratefully acknowledges support from NSF Grant DMS-1308645 and NSA Grant H98230-13-1-0827. M.K. gratefully acknowledges support from the Alfred P. Sloan Foundation, from DARPA Grant N66001-12-1-4226, and from NSF Grant CCF-1017182. E.P. gratefully acknowledges support from NSF Grant DMS-0847661.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthew Kahle.

Additional information

Editor in Charge: Günter M. Ziegler

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hoffman, C., Kahle, M. & Paquette, E. The Threshold for Integer Homology in Random d-Complexes. Discrete Comput Geom 57, 810–823 (2017). https://doi.org/10.1007/s00454-017-9863-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-017-9863-1

Keywords

Mathematics Subject Classification

Navigation