Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes

Lior Aronshtam; Nathan Linial; Tomasz Łuczak; Roy Meshulam

doi:10.1007/s00454-012-9483-8

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes

Lior Aronshtam, Nathan Linial, Tomasz Łuczak, Roy Meshulam

Technion - Israel Institute of Technology, The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

Abstract

Let Δ_n-1 denote the (n - 1)-dimensional simplex. Let Y be a random d-dimensional subcomplex of Δ_n-1 obtained by starting with the full (d - 1)-dimensional skeleton of Δ_n-1 and then adding each d-simplex independently with probability p = c/n. We compute an explicit constant γ_d, with γ₂ ≃ 2. 45, γ₃ ≃ 3.5, and γ_d = Θ (log d) as d → ∞, so that for c < γ_d such a random simplicial complex either collapses to a (d - 1)-dimensional subcomplex or it contains ∂ Δ_d+1, the boundary of a (d + 1)-dimensional simplex. We conjecture this bound to be sharp. In addition, we show that there exists a constant γ_d < c_d < d + 1 such that for any c > c_d and a fixed field F, asymptotically almost surely H_d(Y;F) ≠ 0.

Original language	English
Pages (from-to)	317-334
Number of pages	18
Journal	Discrete and Computational Geometry
Volume	49
Issue number	2
DOIs	https://doi.org/10.1007/s00454-012-9483-8
State	Published - Mar 2013

Keywords

Collapsibility
Random complexes
Simplicial homology

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1007/s00454-012-9483-8

Cite this

@article{b7af170fe62548f7a5a64399c1b01c58,

title = "Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes",

abstract = "Let Δn-1 denote the (n - 1)-dimensional simplex. Let Y be a random d-dimensional subcomplex of Δn-1 obtained by starting with the full (d - 1)-dimensional skeleton of Δn-1 and then adding each d-simplex independently with probability p = c/n. We compute an explicit constant γd, with γ2 ≃ 2. 45, γ3 ≃ 3.5, and γd = Θ (log d) as d → ∞, so that for c < γd such a random simplicial complex either collapses to a (d - 1)-dimensional subcomplex or it contains ∂ Δd+1, the boundary of a (d + 1)-dimensional simplex. We conjecture this bound to be sharp. In addition, we show that there exists a constant γd < cd < d + 1 such that for any c > cd and a fixed field F, asymptotically almost surely Hd(Y;F) ≠ 0.",

keywords = "Collapsibility, Random complexes, Simplicial homology",

author = "Lior Aronshtam and Nathan Linial and Tomasz {\L}uczak and Roy Meshulam",

note = "Funding Information: N. Linial was supported by ISF and BSF grants; T. {\L}uczak was supported by the Foundation for Polish Science; and R. Meshulam was supported by ISF grant with additional partial support from ERC Advanced Research Grant no. 267165 (DISCONV).",

year = "2013",

month = mar,

doi = "10.1007/s00454-012-9483-8",

language = "الإنجليزيّة",

volume = "49",

pages = "317--334",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes

AU - Aronshtam, Lior

AU - Linial, Nathan

AU - Łuczak, Tomasz

AU - Meshulam, Roy

N1 - Funding Information: N. Linial was supported by ISF and BSF grants; T. Łuczak was supported by the Foundation for Polish Science; and R. Meshulam was supported by ISF grant with additional partial support from ERC Advanced Research Grant no. 267165 (DISCONV).

PY - 2013/3

Y1 - 2013/3

N2 - Let Δn-1 denote the (n - 1)-dimensional simplex. Let Y be a random d-dimensional subcomplex of Δn-1 obtained by starting with the full (d - 1)-dimensional skeleton of Δn-1 and then adding each d-simplex independently with probability p = c/n. We compute an explicit constant γd, with γ2 ≃ 2. 45, γ3 ≃ 3.5, and γd = Θ (log d) as d → ∞, so that for c < γd such a random simplicial complex either collapses to a (d - 1)-dimensional subcomplex or it contains ∂ Δd+1, the boundary of a (d + 1)-dimensional simplex. We conjecture this bound to be sharp. In addition, we show that there exists a constant γd < cd < d + 1 such that for any c > cd and a fixed field F, asymptotically almost surely Hd(Y;F) ≠ 0.

AB - Let Δn-1 denote the (n - 1)-dimensional simplex. Let Y be a random d-dimensional subcomplex of Δn-1 obtained by starting with the full (d - 1)-dimensional skeleton of Δn-1 and then adding each d-simplex independently with probability p = c/n. We compute an explicit constant γd, with γ2 ≃ 2. 45, γ3 ≃ 3.5, and γd = Θ (log d) as d → ∞, so that for c < γd such a random simplicial complex either collapses to a (d - 1)-dimensional subcomplex or it contains ∂ Δd+1, the boundary of a (d + 1)-dimensional simplex. We conjecture this bound to be sharp. In addition, we show that there exists a constant γd < cd < d + 1 such that for any c > cd and a fixed field F, asymptotically almost surely Hd(Y;F) ≠ 0.

KW - Collapsibility

KW - Random complexes

KW - Simplicial homology

UR - http://www.scopus.com/inward/record.url?scp=84873738059&partnerID=8YFLogxK

U2 - 10.1007/s00454-012-9483-8

DO - 10.1007/s00454-012-9483-8

M3 - مقالة

SN - 0179-5376

VL - 49

SP - 317

EP - 334

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 2

ER -

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this