Scaling Behaviour of Developing and Decaying Networks

@article{Dorogovtsev2000ScalingBO,
  title={Scaling Behaviour of Developing and Decaying Networks},
  author={Sergey N. Dorogovtsev and Jos{\'e} F. F. Mendes},
  journal={EPL},
  year={2000},
  volume={52},
  pages={33-39}
}
We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barabasi and Albert in the particular case of growing networks. The networks considered here evolve according to the following rules: i) Each instant a new site is added, the probability of its connection to old sites is proportional to their connectivities. ii) In addition, a) new links between some old sites appear with probability proportional to the product of… 
Local Events and Dynamics on Weighted Complex Networks
We examine the weighted networks grown and evolved by local events, such as the addition of new vertices and links and we show that depending on frequency of the events, a generalized power-law
Weighted evolving networks.
TLDR
This paper introduces and investigates the scaling properties of a class of models which assign weights to the links as the network evolves, and indicates that asymptotically the total weight distribution converges to the scaling behavior of the connectivity distribution, but this convergence is hampered by strong logarithmic corrections.
Evolving network with different edges.
  • Jie SunYizhi GeSheng Li
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
We propose a scale-free network similar to Barabasi-Albert networks but with two different types of edges. This model is based on the idea that in many cases there are more than one kind of link in a
Network dynamics: the world wide web
TLDR
This thesis finds power-law distributions in website sizes, traffic, and links, and more importantly, develops a stochastic theory which explains them and demonstrates that the Web is a “small world”.
Evolving pseudofractal networks
TLDR
A family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm, is presented, finding that a special case of the model can be mapped into the Yule process.
3 Emergence of scaling in complex networks
TLDR
There is increasing evidence that networks appearing in diverse systems share common topological and dynamical features, indicating the existence of robust self-organizing principles and evolutionary laws that govern the interwoven natural and social world around us.
Accelerated growth of networks
TLDR
It is shown that the accelerated growth of networks fairly well explains the structure of the Word Web (the network of interacting words of human language) and is used to describe a wealth condensation transition in evolving societies.
Evolution of networks
TLDR
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
Scale-free and stable structures in complex ad hoc networks.
TLDR
The dynamics reported in this paper can be used to craft protocols for designing highly dynamic peer-to-peer networks and also to account for the power-law exponents observed in existing popular services.
A constant acceleration local-world model for complex networks
  • D. YangLijun Zhang
  • Computer Science
    2010 International Conference on Information, Networking and Automation (ICINA)
  • 2010
TLDR
The constant acceleration local-world model is applied to characterize the Internet against BA model, demonstrating the superiority of the new model.
...
...

References

SHOWING 1-3 OF 3 REFERENCES
Small worlds
TLDR
This paper considers some particular instances of small world models, and rigorously investigates the distribution of their inter‐point network distances, framed in terms of approximations, whose accuracy increases with the size of the network.
Growing network with heritable connectivity of nodes
TLDR
The nontrivial version of this model, in which preferential linking is combined with partial inheritance of connectivity (number of incoming links) of individual nodes by new ones, is solved exactly in the limit of a large network size.
Random Graphs