Related papers: Topology of random 2-complexes

As a first step towards a conjecture of Kahle and Newman, we prove that if $T_n$ is a random $2$-dimensional determinantal hypertree on $n$ vertices, then \[\frac{\dim H_1(T_n,\mathbb{F}_2)}{n^2}\] converges to zero in probability.…

A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Let $G$ be a free-by-cyclic group or a 2-dimensional right-angled Artin group. We provide an algebraic and a geometric characterization for when each aspherical simplicial complex with fundamental group isomorphic to $G$ has minimal volume…

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. The soft random simplicial complexes is a model for random simplicial complexes built over the…

Simplicial complexes are increasingly used to understand the topology of complex systems as different as brain networks and social interactions. It is therefore of special interest to extend the study of percolation to simplicial complexes.…

We prove that in the $d$-dimensional Linial--Meshulam stochastic process the $(d - 1)$st homology group with integer coefficients vanishes exactly when the final isolated $(d - 1)$-dimensional face is covered by a top-dimensional face. This…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

Amit and Linial showed that a random lift of a graph with minimum degree $\delta\ge3$ is asymptotically almost surely $\delta$-connected, and mentioned the problem of estimating this probability as a function of the degree of the lift. We…

Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

In this paper we study the structure of complex points of codimension 2 real submanifolds in complex $n$ dimensional manifolds. We show that the local structure of a complex point up to isotopy only depends on their type (either elliptic or…

Let Y ~ Y_d(n,p) denote the Bernoulli random d-dimensional simplicial complex. We answer a question of Linial and Meshulam from 2003, showing that the threshold for vanishing of homology H_{d-1}(Y; Z) is less than 80d log n / n. This bound…

Let $\mathcal{H}$ be a hypergraph of rank $r$. We show that the simplicial complex whose simplices are the hypergraphs $\mathcal{F}\subset\mathcal{H}$ with covering number at most $p$ is $\left(\binom{r+p}{r}-1\right)$-collapsible, and the…

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…

Algorithms for persistent homology and zigzag persistent homology are well-studied for persistence modules where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under…

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…

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…

We couple twisted non-compact N=(2,2) supersymmetric models to topological gravity in two dimensions. We propose expressions for the genus zero correlation functions based on a Kadomtsev-Petviashvili integrable hierarchy. Moreover, we prove…

We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…