Related papers: Strong Collapse of Random Simplicial Complexes
In this paper we consider a family of simplicial complexes, which we call the view complexes. Our choice of objects of study is motivated by theoretical distributed computing, since the view complex is a key simplicial construction used for…
Spontaneous symmetry breaking is a cornerstone of modern physics, defining a wealth of phenomena in condensed-matter and high-energy physics, and beyond. It requires an infinite number of degrees of freedom, and even then, for continuous…
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
In this paper we determine the threshold for collapsibility in the probabilistic model $X_d(n,p)$ of $d$-dimensional simplicial complexes. A lower bound for this threshold $p=\frac{c_d}{n}$ was established in \cite{ALLM}. Here we show that…
We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…
We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…
A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…
In sufficiently complex models with many parameters that are unknown or undetermined from first principles, a small coupling or mass can naturally arise even if it is not protected by a symmetry or a result of some dynamics. For the…
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…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class…
In terms of the Dirac representation of sample mean and the weak convergence of empirical distributions that holds almost surely, we construct a new proof for a strong law of large numbers of Kolmogorov's type with i.i.d. random variables…
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…
We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…
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…
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 show that the finite simply connected 2-complexes of nonpositive planar sectional curvature are collapsible. Moreover, we show that each finite connected 2-complex with negative planar sectional curvature and fundamental group…
We tackle the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch 20 years ago. We show that this decision…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…