The fundamental group of random 2-complexes.
From MaRDI portal
Publication:3074550
Random graphs (graph-theoretic aspects) (05C80) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45) Geometric group theory (20F65) Hyperbolic groups and nonpositively curved groups (20F67) Topological methods in group theory (57M07) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34)
Abstract: We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of ErdH{o}s-R'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the first homology group, which was shown earlier by Linial and Meshulam to be p = 2 log(n)/n. We use a variant of Gromov's local-to-global theorem for linear isoperimetric inequalities to show that when p = O(n^{-1/2 -epsilon}) the fundamental group is word hyperbolic. Along the way we classify the homotopy types of sparse 2-dimensional simplicial complexes and establish isoperimetric inequalities for such complexes. These intermediate results do not involve randomness and may be of independent interest.
Recommendations
Cites work
- scientific article; zbMATH DE number 437296 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 5012619 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 848089 (Why is no real title available?)
- A short proof that a subquadratic isoperimetric inequality implies a linear one
- Every monotone graph property has a sharp threshold
- Homological connectivity of random 2-complexes
- Homological connectivity of random k -dimensional complexes
- Property (T) and Kazhdan constants for discrete groups
- Random graphs.
- The neighborhood complex of a random graph
- Topological characteristics of random triangulated surfaces
- Topology of random clique complexes
Cited in
(44)- Maps on random hypergraphs and random simplicial complexes
- Topology of random geometric complexes: a survey
- The threshold function for vanishing of the top homology group of random \(d\)-complexes
- The threshold for \(d\)-collapsibility in random complexes
- Random groups arising as graph products.
- Quantitative aspects of acyclicity
- Geometry and topology of random 2-complexes
- Random Simplicial Complexes: Models and Phenomena
- On the codimension-two cohomology of \(\mathrm{SL}_{n}(\mathbb{Z})\)
- The asphericity of random 2‐dimensional complexes
- Topology and geometry of random 2-dimensional hypertrees
- Large random simplicial complexes. I
- On multiplicative \(\lambda\)-approximations and some geometric applications
- Freeness of the random fundamental group
- Asymptotic degree of random monomial ideals
- Coboundary expanders
- Integral homology of random simplicial complexes
- Topology of random 2-complexes
- Local and global expansion in random geometric graphs
- What Are Higher-Order Networks?
- A random triadic process
- Topology of random right angled Artin groups
- Crackle: the homology of noise
- On topological minors in random simplicial complexes
- On the phase transition in random simplicial complexes
- When does the top homology of a random simplicial complex vanish?
- A random triadic process
- The expected genus of a random chord diagram
- Homology of multi-parameter random simplicial complexes
- Random simplicial complexes: around the phase transition
- On simple connectivity of random 2-complexes
- Large deviation principle for persistence diagrams of random cubical filtrations
- Emergent network modularity
- Inside the critical window for cohomology of random \(k\)-complexes
- Sharp vanishing thresholds for cohomology of random flag complexes
- Large random simplicial complexes. II: The fundamental group
- Fundamental groups of clique complexes of random graphs
- Topology of random -dimensional cubical complexes
- Random geometric complexes
- Topics of Stochastic Algebraic Topology
- Minimum weight disk triangulations and fillings
- On the topology of random complexes built over stationary point processes
- Random hypergraphs, random simplicial complexes and their Künneth-type formulae
- One‐sided sharp thresholds for homology of random flag complexes
This page was built for publication: The fundamental group of random 2-complexes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3074550)
