Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRandom Abstract Simplicial Complexes Reduction
190
0
0.0
(
0
)
Added by
Anais Vergne
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Authors
Anais Vergne
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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.
We correct the proofs of the main theorems in our paper Limit theorems for Betti numbers of random simplicial complexes.
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 have been recently established rigorously in mathematics, especially in the context of algebraic topology. In application to real-world systems, the reviewed models are typically used as null models, so that we take a statistical stance, emphasizing, where applicable, the entropic properties of the reviewed models. We also review a collection of phenomena and features observed in these models, and split the presented results into two classes: phase transitions and distributional limits. We conclude with an outline of interesting future research directions.
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 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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
