Affordable Access

deepdyve-link deepdyve-link
Publisher Website

Criticality in Random Threshold Networks: Annealed Approximation and Beyond

Authors
  • Rohlf, Thimo
  • Bornholdt, Stefan
Type
Published Article
Publication Date
Jan 07, 2002
Submission Date
Jan 07, 2002
Identifiers
DOI: 10.1016/S0378-4371(02)00798-7
arXiv ID: cond-mat/0201079
Source
arXiv
License
Unknown
External links

Abstract

Random Threshold Networks with sparse, asymmetric connections show complex dynamical behavior similar to Random Boolean Networks, with a transition from ordered to chaotic dynamics at a critical average connectivity $K_c$. In this type of model - contrary to Boolean Networks - propagation of local perturbations (damage) depends on the in-degree of the sites. $K_c$ is determined analytically, using an annealed approximation, and the results are confirmed by numerical simulations. It is shown that the statistical distributions of damage spreading near the percolation transition obey power-laws, and dynamical correlations between active network clusters become maximal. We investigate the effect of local damage suppression at highly connected nodes for networks with scale-free in-degree distributions. Possible relations of our findings to properties of real-world networks, like robustness and non-trivial degree-distributions, are discussed.

Report this publication

Statistics

Seen <100 times