Synchronization Properties of Network Motifs
arXiv:physics/0609126 · doi:10.1209/0295-5075/78/28001
Abstract
We address the problem of understanding the variable abundance of 3-node and 4-node subgraphs (motifs) in complex networks from a dynamical point of view. As a criterion in the determination of the functional significance of a n-node subgraph, we propose an analytic method to measure the stability of the synchronous state (SSS) the subgraph displays. We show that, for undirected graphs, the SSS is correlated with the relative abundance, while in directed graphs the correlation exists only for some specific motifs.
7 pages, 3 figures
References in corpus (7)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Synchronization in small-world systems
- The topological relationship between the large-scale attributes and local interaction patterns of complex networks
- Synchronization is optimal in non-diagonalizable networks
- Synchronization in scale-free network with asymmetric coupling
- Fitness for Synchronization of Network Motifs
Cited by in corpus (17)
- Synchronization in complex networks
- Networks beyond pairwise interactions: structure and dynamics
- Explosive transitions in complex networks' structure and dynamics: percolation and synchronization
- Synchronization in networks with multiple interaction layers
- Dynamical and spectral properties of complex networks
- Analysis of Remote Synchronization in Complex Networks
- Synchronization of dynamical hypernetworks: dimensionality reduction through simultaneous block-diagonalization of matrices
- Spectral Coarse Graining and Synchronization in Oscillator Networks
- Diffusion Dynamics and Optimal Coupling in Directed Multiplex Networks
- Graphical notation reveals topological stability criteria for collective dynamics in complex networks
- Chain motifs: The tails and handles of complex networks
- Motion-induced synchronization in metapopulations of mobile agents
- Tweaking Synchronisation by Link Addition
- Motifs in Triadic Random Graphs based on Steiner Triple Systems
- Analytic relationship of relative synchronizability to network structure and motifs
- Optimal synchronization on strongly connected directed networks
- On the Role of Triadic Substructures in Complex Networks