An analytically solvable model of probabilistic network dynamics
Cellular Automata and Lattice Gases
2009-11-11 v1 Exactly Solvable and Integrable Systems
Abstract
We present a simple model of network dynamics that can be solved analytically for uniform networks. We obtain the dynamics of response of the system to perturbations. The analytical solution is an excellent approximation for random networks. A comparison with the scale-free network, though qualitatively similar, shows the effect of distinct topology.
Cite
@article{arxiv.nlin/0503038,
title = {An analytically solvable model of probabilistic network dynamics},
author = {M. A. M. de Aguiar and Irving R. Epstein and Yaneer Bar-Yam},
journal= {arXiv preprint arXiv:nlin/0503038},
year = {2009}
}
Comments
4 pages, 1 figure