An analytically solvable model of probabilistic network dynamics
classification
🌊 nlin.CG
nlin.SI
keywords
dynamicsnetworkanalyticallymodelnetworksanalyticalapproximationcomparison
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.