Related papers: Limit theorems for Betti numbers of random simplic…
Motivated by an application in community detection, we consider an \ER random graph conditioned on the rare event that all connected components are fully connected. Such graphs can be considered as partitions of vertices into cliques.…
We find some general lower bounds of the sum of certain families of multigraded Betti numbers of any simplicial complex with a vertex coloring.
We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…
We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals emerging in stochastic geometry. As a consequence, we provide almost sure central limit theorems for $(i)$ the total…
Let $M$ be a compact, unit volume, Riemannian manifold with boundary. In this paper we study the homology of a random \v{C}ech-complex generated by a homogeneous Poisson process in $M$. Our main results are two asymptotic threshold…
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…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
In this paper, we study the expectation values of topological invariants of the Vietoris-Rips complex and \v{C}ech complex for a finite set of sample points on a Riemannian manifold. We show that the Betti number and Euler characteristic of…
We employ the formalism of vanishing cycles and perverse sheaves to introduce and study the vanishing cohomology of complex projective hypersurfaces. As a consequence, we give upper bounds for the Betti numbers of projective hypersurfaces,…
We address the general problem of estimating the probability that a real symmetric tensor is close to rank-one tensors. Using Weyl's tube formula, we turn this question into a differential geometric one involving the study of metric…
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…
Inspired by recent results of Ein, Lazarsfeld, Erman and Zhou on the non-vanishing of Betti numbers of high Veronese subrings, we describe the behaviour of the Betti numbers of Stanley-Reisner rings associated with iterated barycentric or…
An exact computation of the persistent Betti numbers of a submanifold $X$ of a Euclidean space is possible only in a theoretical setting. In practical situations, only a finite sample of $X$ is available. We show that, under suitable…
We use the probabilistic method to construct examples of conjectured phenomenon about asymptotic syzygies. In particular, we use the Stanley-Reisner ideals of random flag complexes to construct new examples of Ein and Lazarsfeld's…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…
We define a variant of Benjamini-Schramm convergence for finite simplicial complexes with the action of a fixed finite group G which leads to the notion of random rooted simplicial G-complexes. For every random rooted simplicial G-complex…
Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend on a large number of parameters -- the lengths of the bars of the linkage. Motivated by applications in topological robotics, statistical…
Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…
In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…