Dynamic Computation of Network Statistics via Updating Schema

Simple item page
dc.creatorSun, Jie
dc.creatorBagrow, James P.
dc.creatorBollt, Erik M.
dc.creatorSkufca, Joesph D.
dc.date2008-09-26
dc.date.accessioned2026-07-07T12:58:49Z
dc.date.available2026-07-07T12:58:49Z
dc.descriptionIn 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.
dc.description17 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/0809.4707
dc.identifierhttp://arxiv.org/abs/0809.4707
dc.identifierPhys. Rev. E 79, 036116 (2009) [9 pages]
dc.identifierdoi:10.1103/PhysRevE.79.036116
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225371
dc.subjectData Analysis, Statistics and Probability
dc.titleDynamic Computation of Network Statistics via Updating Schema
dc.typetext

Files

Collections

arXiv