NETWORKS:

ANALYTICALLY SOLVABLE MODEL OF PROBABILISTIC NETWORK DYNAMICS

Abstract

We present a simple model of network dynamics that can be solved analytically for fully connected 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.

Back to Networks page

Back to Recent Publications page

Back to NECSI Research page