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

Generating Simplicial Complexes

319   0   0.0 ( 0 )
 نشر من قبل Daniel Pons
 تاريخ النشر 2010
  مجال البحث
والبحث باللغة English




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

In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For expansive systems remarkable properties are observed. Known examples are revisited and new examples are presented.


قيم البحث

اقرأ أيضاً

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting family. As immediate consequences, we recover the classical van Kampen--Flores theorem and provide a topological extension of the ErdH os--Ko--Rado theorem. By analogy with Farys theorem for planar graphs, we show in addition that such complexes satisfy the rigidity property that continuous and linear embeddability are equivalent.
Simplicial complexes are a versatile and convenient paradigm on which to build all the tools and techniques of the logic of knowledge, on the assumption that initial epistemic models can be described in a distributed fashion. Thus, we can define: kno wledge, belief, bisimulation, the group notions of mutual, distributed and common knowledge, and also dynamics in the shape of simplicial action models. We give a survey on how to interpret all such notions on simplicial complexes, building upon the foundations laid in prior work by Goubault and others.
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.
150 - Z. Li , Z. Deng , Z. Han 2021
The propagation of information in social, biological and technological systems represents a crucial component in their dynamic behavior. When limited to pairwise interactions, a rather firm grip is available on the relevant parameters and critical tr ansitions of these spreading processes, most notably the pandemic transition, which indicates the conditions for the spread to cover a large fraction of the network. The challenge is that, in many relevant applications, the spread is driven by higher order relationships, in which several components undergo a group interaction. To address this, we analyze the spreading dynamics in a simplicial complex environment, designed to capture the coexistence of interactions of different orders. We find that, while pairwise interactions play a key role in the initial stages of the spread, once it gains coverage, higher order simplices take over and drive the contagion dynamics. The result is a distinctive spreading phase diagram, exhibiting a discontinuous pandemic transition, and hence offering a qualitative departure from the traditional network spreading dynamics.
151 - Jixiang Fu , Xiaofeng Meng 2021
We estimate the upper bound for the $ell^{infty}$-norm of the volume form on $mathbb{H}^2timesmathbb{H}^2timesmathbb{H}^2$ seen as a class in $H_{c}^{6}(mathrm{PSL}_{2}mathbb{R}timesmathrm{PSL}_{2}mathbb{R}timesmathrm{PSL}_{2}mathbb{R};mathbb{R})$. T his gives the lower bound for the simplicial volume of closed Riemennian manifolds covered by $mathbb{H}^{2}timesmathbb{H}^{2}timesmathbb{H}^{2}$. The proof of these facts yields an algorithm to compute the lower bound of closed Riemannian manifolds covered by $big(mathbb{H}^2big)^n$.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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