Contagion in simplicial complexes

نویسندگان

چکیده

The propagation of information in social, biological and technological systems represents a crucial component their dynamic behavior. When limited to pairwise interactions, rather firm grip is available on the relevant parameters critical transitions these spreading processes, most notably pandemic transition, which indicates conditions for spread cover large fraction network. challenge that, many applications, driven by higher order relationships, several components undergo group interaction. To address this, we analyze dynamics simplicial complex environment, designed capture coexistence interactions different orders. We find while play key role initial stages spread, once it gains coverage, simplices take over drive contagion dynamics. result distinctive phase diagram, exhibiting discontinuous hence offering qualitative departure from traditional network

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

Centralities in Simplicial Complexes

Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness, betweenness, eigenvector, Ka...

متن کامل

Isoperimetric inequalities in simplicial complexes

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a complex, and the spectrum of the high dimensional Laplacian defined by Eckmann. In...

متن کامل

Saturated simplicial complexes

Among shellable complexes a certain class has maximal modular homology, and these are the so-called saturated complexes. We extend the notion of saturation to arbitrary pure complexes and give a survey of their properties. It is shown that saturated complexes can be characterized via the p -rank of incidence matrices and via the structure of links. We show that rank-selected subcomplexes of sat...

متن کامل

Completions and Simplicial Complexes

We first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. We show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈CUP〉 and 〈CAP〉, in order to define, in an axiomatic way, a remarkable collection of acyclic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chaos Solitons & Fractals

سال: 2021

ISSN: ['1873-2887', '0960-0779']

DOI: https://doi.org/10.1016/j.chaos.2021.111307