Search arXivSearch

arXiv · 2111.12254

Emergence of dynamic properties in network hyper-motifs

Abstract

Networks are fundamental for our understanding of complex systems. Interactions between individual nodes in networks generate network motifs - small recurrent patterns that can be considered the network's building-block components, providing certain dynamical properties. However, it remains unclear how network motifs are arranged within networks and what properties emerge from interactions between network motifs. Here we develop a framework to explore the mesoscale-level behavior of complex networks. Considering network motifs as hyper-nodes, we define the rules for their interaction at the network's next level of organization. We infer the favorable arrangements of interactions between network motifs into hyper-motifs from real evolved and designed networks data including biological, neuronal, social, linguistic and electronic networks. We mathematically explore the emergent properties of these higher-order circuits and their relations to the properties of the individual minimal circuit components they combine. This framework provides a basis for exploring the mesoscale structure and behavior of complex systems where it can be used to reveal intermediate patterns in complex networks and to identify specific nodes and links in the network that are the key drivers of the network's emergent properties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miri Adler, Ruslan Medzhitov. 2021-12-01. Emergence of dynamic properties in network hyper-motifs. https://doi.org/10.1073/pnas.2204967119

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS