Inside the critical window for cohomology of random k -complexes
From MaRDI portal
Publication:3467581
DOI10.1002/rsa.20577zbMath1333.05272arXiv1301.1324OpenAlexW1989181831MaRDI QIDQ3467581
Matthew Kahle, Boris G. Pittel
Publication date: 3 February 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1324
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Classical real and complex (co)homology in algebraic geometry (14F25) Simplicial sets and complexes in algebraic topology (55U10) Connectivity (05C40) Combinatorial aspects of simplicial complexes (05E45)
Related Items (17)
Limit theory for U-statistics under geometric and topological constraints with rare events ⋮ Threshold and hitting time for high-order connectedness in random hypergraphs ⋮ Random Simplicial Complexes: Models and Phenomena ⋮ Homological connectivity in random Čech complexes ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Maps on random hypergraphs and random simplicial complexes ⋮ The integer homology threshold in 𝑌_{𝑑}(𝑛,𝑝) ⋮ Algebraic and combinatorial expansion in random simplicial complexes ⋮ Homological connectedness of random hypergraphs ⋮ Random hypergraphs, random simplicial complexes and their Künneth-type formulae ⋮ Integral homology of random simplicial complexes ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Forcing large tight components in 3-graphs ⋮ Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes ⋮ Vanishing of cohomology groups of random simplicial complexes ⋮ Minimum weight disk triangulations and fillings ⋮ Convergence of persistence diagram in the sparse regime
Cites Work
- Unnamed Item
- Homological connectivity of random 2-complexes
- The expected linearity of a simple equivalence algorithm
- The asymptotic number of labeled graphs with given degree sequences
- Collapsibility and vanishing of top homology in random simplicial complexes
- Clique percolation
- The threshold function for vanishing of the top homology group of random 𝑑-complexes
- The fundamental group of random 2-complexes
- Homological connectivity of random k -dimensional complexes
- On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
This page was built for publication: Inside the critical window for cohomology of random k -complexes
