Random complexes with free involution
Florian Frick, Andrew Newman

TL;DR
This paper introduces a new model for random simplicial complexes with a free involution, analyzing their typical topology and establishing a probabilistic Borsuk--Ulam theorem, with applications to Erdős–Rényi graphs.
Contribution
The paper develops a novel model for random complexes with a free involution and studies their asymptotic topological properties, including a probabilistic Borsuk--Ulam theorem.
Findings
Complexes often have simply-connected double covers.
Bounds for dimensions where equivariant maps have zeros.
Structural insights into non-adjacent cliques in random graphs.
Abstract
We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group . We establish results about the typical asymptotic topology of these complexes. As a consequence we give bounds for the dimension such that -equivariant maps from the double cover to have zeros with high probability, thus establishing a random Borsuk--Ulam theorem. We apply this to derive a structural result for pairs of non-adjacent cliques in Erd\H{o}s--R\'{e}nyi random graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · History and advancements in chemistry
