arXiv · math-ph/0506019
Evolving Networks and Birth-and-Death Processes
Abstract
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of non-homogeneous birth-and-death processes, and, with which, we capture the process by which the network connectivity evolves. We develop an effective algorithm to compute the network degree distribution accurately. Comparing analytical and numerical results with simulation, we identify some interesting network properties and verify the effectiveness of our method.
Explore related subjects
Keep this discovery
Dinghua Shi, Liming Liu, Xiang Zhu, Huijie Zhou, Binbin Wang. 2005-06-09. Evolving Networks and Birth-and-Death Processes. https://arxiv.org/abs/math-ph/0506019
Cite the original work for its findings. Save a collection to share your selection of sources.