English
Related papers

Related papers: Random complexes with free involution

200 papers

We describe topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters $p_\sigma$ approach neither $0$ nor $1$. We show that nontrivial Betti numbers…

Algebraic Topology · Mathematics 2019-07-23 Michael Farber , Lewis Mead

We study random 2-dimensional complexes in the Linial - Meshulam model and prove that for the probability parameter satisfying $$p\ll n^{-46/47}$$ a random 2-complex $Y$ contains several pairwise disjoint tetrahedra such that the 2-complex…

Algebraic Topology · Mathematics 2012-11-16 A. E. Costa , M. Farber

Using the random complexes of Linial and Meshulam, we exhibit a large family of simplicial complexes for which, whenever affinely embedded into Euclidean space, the filling areas of simplicial cycles is greatly distorted. This phenomenon…

Metric Geometry · Mathematics 2014-10-29 Dominic Dotterrer

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…

Combinatorics · Mathematics 2016-07-26 Tomasz Łuczak , Yuval Peled

The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…

Combinatorics · Mathematics 2023-09-12 Eric Babson , Jan Spaliński

We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…

Geometric Topology · Mathematics 2025-12-01 Sophie Wright

We define a model for random (abstract) cell complexes (CCs), similiar to the well-known Erd\H{o}s-R\'enyi model for graphs and its extensions for simplicial complexes. To build a random cell complex, we first draw from an Erd\H{o}s-R\'enyi…

Data Structures and Algorithms · Computer Science 2025-11-21 Josef Hoppe , Michael T. Schaub

We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…

Probability · Mathematics 2019-10-23 Nikolaos Fountoulakis , Michał Przykucki

Let (X, t, S) be a triple, where S is a compact, connected surface without boundary, and t is a free cellular involution on a CW-complex X. The triple (X, t, S) is said to satisfy the Borsuk-Ulam property if for every continuous map…

Geometric Topology · Mathematics 2010-05-21 Daciberg Lima Gonçalves , John Guaschi

Several years ago Linial and Meshulam introduced a model called X_d(n,p) of random n-vertex d-dimensional simplicial complexes. The following question suggests itself very naturally: What is the threshold probability p=p(n) at which the…

Combinatorics · Mathematics 2012-03-16 L. Aronshtam , N. Linial

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…

Combinatorics · Mathematics 2025-06-13 Kathryn Lesh , Bridget Schreiner , Nathalie Wahl

We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…

Combinatorics · Mathematics 2016-04-05 Oliver Cooley , Penny Haxell , Mihyun Kang , Philipp Sprüssel

As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied…

Probability · Mathematics 2025-06-16 Dominik Pabst

We present an elementary way to transform an expander graph into a simplicial complex where all high order random walks have a constant spectral gap, i.e., they converge rapidly to the stationary distribution. As an upshot, we obtain new…

Discrete Mathematics · Computer Science 2019-11-22 Siqi Liu , Sidhanth Mohanty , Elizabeth Yang

Turaev conjectured that the classification, realization and splitting results for Poincar\'e duality complexes of dimension $3$ (PD$_{3}$-complexes) generalize to PD$_{n}$-complexes with $(n-2)$-connected universal cover for $n \ge 3$.…

Algebraic Topology · Mathematics 2021-02-24 Beatrice Bleile , Imre Bokor , Jonathan A. Hillman

Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…

Combinatorics · Mathematics 2017-02-20 Ori Parzanchevski , Ron Rosenthal

We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a…

Combinatorics · Mathematics 2024-01-24 Ran Tessler , Elad Tzalik

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the…

Combinatorics · Mathematics 2007-05-23 Svante Janson

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

Combinatorics · Mathematics 2022-10-04 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang