Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLimit theorems for Betti numbers of random simplicial complexes
181
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
There have been several recent articles studying homology of various types of random simplicial complexes. Several theorems have concerned thresholds for vanishing of homology, and in some cases expectations of the Betti numbers. However little seems known so far about limiting distributions of random Betti numbers. In this article we establish Poisson and normal approximation theorems for Betti numbers of different kinds of random simplicial complex: ErdH{o}s-Renyi random clique complexes, random Vietoris-Rips complexes, and random v{C}ech complexes. These results may be of practical interest in topological data analysis.
rate research
Read More
We correct the proofs of the main theorems in our paper Limit theorems for Betti numbers of random simplicial complexes.
Random abstract simplicial complex representation provides a mathematical description of wireless networks and their topology. In order to reduce the energy consumption in this type of network, we intend to reduce the number of network nodes without modifying neither the connectivity nor the coverage of the network. In this paper, we present a reduction algorithm that lower the number of points of an abstract simplicial complex in an optimal order while maintaining its topology. Then, we study the complexity of such an algorithm for a network simulated by a binomial point process and represented by a Vietoris-Rips complex.
We study the topology of a random cubical complex associated to Bernoulli site percolation on a cubical grid. We begin by establishing a limit law for homotopy types. More precisely, looking within an expanding window, we define a sequence of normalized counting measures (counting connected components according to homotopy type), and we show that this sequence of random probability measures converges in probability to a deterministic probability measure. We then investigate the dependence of the limiting homotopy measure on the coloring probability $p$, and our results show a qualitative change in the homotopy measure as $p$ crosses the percolation threshold $p=p_c$. Specializing to the case of $d=2$ dimensions, we also present empirical results that raise further questions on the $p$-dependence of the limiting homotopy measure.
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 every compact topological manifold, both in isolation and in percolation.
We investigate the topologies of random geometric complexes built over random points sampled on Riemannian manifolds in the so-called thermodynamic regime. We prove the existence of universal limit laws for the topologies; namely, the random normalized counting measure of connected components (counted according to homotopy type) is shown to converge in probability to a deterministic probability measure. Moreover, we show that the support of the deterministic limiting measure equals the set of all homotopy types for Euclidean geometric complexes of the same dimension as the manifold.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
