Dynamic Computation of Network Statistics via Updating Schema
arXiv:0809.4707 · doi:10.1103/PhysRevE.79.036116
Abstract
In this paper we derive an updating scheme for calculating some important network statistics such as degree, clustering coefficient, etc., aiming at reduce the amount of computation needed to track the evolving behavior of large networks; and more importantly, to provide efficient methods for potential use of modeling the evolution of networks. Using the updating scheme, the network statistics can be computed and updated easily and much faster than re-calculating each time for large evolving networks. The update formula can also be used to determine which edge/node will lead to the extremal change of network statistics, providing a way of predicting or designing evolution rule of networks.
17 pages, 6 figures
References in corpus (8)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Modularity and community structure in networks
- Assortative mixing in networks
- Dynamical and correlation properties of the Internet
- Large-scale topological and dynamical properties of Internet
- Understanding the internet topology evolution dynamics