Related papers: Large simplicial complexes: Universality, Randomne…
Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…
A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…
Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles under the constraints that the expected values of a set of graph observables are equal to given…
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…
In this paper we develop further the multi-parameter model of random simplicial complexes. Firstly, we give an intrinsic characterisation of the multi-parameter probability measure. Secondly, we show that in multi-parameter random…
A Rado simplicial complex X is a generalisation of the well-known Rado graph. X is a countable simplicial complex which contains any countable simplicial complex as its induced subcomplex. The Rado simplicial complex is highly symmetric, it…
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…
The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…
In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…
We study random simplicial complexes in the multi-parameter upper model. In this model simplices of various dimensions are taken randomly and independently, and our random simplicial complex $Y$ is then taken to be the minimal simplicial…
In this expository article, we survey the rapidly emerging area of random geometric simplicial complexes.
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…
We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…
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…
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…
We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost surely contains infinitely many copies of…