Master-equation analysis of accelerating networks
arXiv:0810.4119 · doi:10.1103/PhysRevE.79.056101
Abstract
In many real-world networks, the rates of node and link addition are time dependent. This observation motivates the definition of accelerating networks. There has been relatively little investigation of accelerating networks and previous efforts at analyzing their degree distributions have employed mean-field techniques. By contrast, we show that it is possible to apply a master-equation approach to such network development. We provide full time-dependent expressions for the evolution of the degree distributions for the canonical situations of random and preferential attachment in networks undergoing constant acceleration. These results are in excellent agreement with results obtained from simulations. We note that a growing, non-equilibrium network undergoing constant acceleration with random attachment is equivalent to a classical random graph, bridging the gap between non-equilibrium and classical equilibrium networks.
6 pages, 1 figure, 1 table
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Mean-field theory for scale-free random networks
- Evolution of the social network of scientific collaborations
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Large-scale topological and dynamical properties of Internet
- Effect of the accelerating growth of communications networks on their structure
- Exact Solution for the Time Evolution of Network Rewiring Models
- Accelerating, hyper-accelerating, and decelerating probabilistic networks
- Accelerated growth in outgoing links in evolving networks: deterministic vs. stochastic picture
- Effects of accelerating growth on the evolution of weighted complex networks
- Accelerating networks
- Link-space formalism for network analysis