The threshold for d-collapsibility in random complexes*

DOI10.1002/rsa.20585zbMath1332.05158arXiv1307.2684OpenAlexW2043114757MaRDI QIDQ2795743

Nathan Linial, Lior Aronshtam

Publication date: 22 March 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2684

zbMATH Keywords

simplicial complextopologycollapsibilitycombinatory

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45)

Related Items (13)

Random Simplicial Complexes: Models and Phenomena ⋮ On the phase transition in random simplicial complexes ⋮ Maps on random hypergraphs and random simplicial complexes ⋮ The local weak limit of 𝑘-dimensional hypertrees ⋮ Abelian groups from random hypergraphs ⋮ Random hypergraphs, random simplicial complexes and their Künneth-type formulae ⋮ One‐sided sharp thresholds for homology of random flag complexes ⋮ Random Simplicial Complexes: Around the Phase Transition ⋮ On the structure of random graphs with constant \(r\)-balls ⋮ Largest Components in Random Hypergraphs ⋮ Freeness of the random fundamental group ⋮ Cohen–Lenstra Heuristics for Torsion in Homology of Random Complexes ⋮ Collapsibility of random clique complexes

Cites Work

• Unnamed Item
• Topology of random 2-complexes
• Homological connectivity of random 2-complexes
• Sudden emergence of a giant \(k\)-core in a random graph
• Collapsibility and vanishing of top homology in random simplicial complexes
• The threshold for integer homology in random \(d\)-complexes
• The fundamental group of random 2-complexes
• Homological connectivity of random k -dimensional complexes
• When does the top homology of a random simplicial complex vanish?
• Cores in random hypergraphs and Boolean formulas

This page was built for publication: The threshold for d-collapsibility in random complexes*