ترغب بنشر مسار تعليمي؟ اضغط هنا

Homotopy Types of Random Cubical Complexes

139   0   0.0 ( 0 )
 نشر من قبل Erik Lundberg
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

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.



قيم البحث

اقرأ أيضاً

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 implement an algorithm RSHT (Random Simple-Homotopy) to study the simple-homotopy types of simplicial complexes, with a particular focus on contractible spaces and on finding substructures in higher-dimensional complexes. The algorithm combines el ementary simplicial collapses with pure elementary expansions. For triangulated d-manifolds with d < 7, we show that RSHT reduces to (random) bistellar flips. Among the many examples on which we test RSHT, we describe an explicit 15-vertex triangulation of the Abalone, and more generally, (14k+1)-vertex triangulations of Bings houses with k rooms, which all can be deformed to a point using only six pure elementary expansions.
181 - Anais Vergne 2013
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 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 normaliz ed 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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا