Scale-free networks without growth
arXiv:cond-mat/0512485 · doi:10.1016/j.physa.2007.11.005
Abstract
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of , by using a two-order master equation, we obtain the analytic solution of degree distribution in stable state of the network evolution under the condition that the selection probability in rewiring process only depends on nodes' degrees. A particular kind of the present networks with linearly correlated with degree is studied in detail. The analysis and simulations show that the degree distributions of these networks can varying from the Possion form to the power-law form with the decrease of a free parameter , indicating the growth may not be a necessary condition of the self-organizaton of a network in a scale-free structure.
4 pages and 3 figures
References in corpus (15)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Characterization of complex networks: A survey of measurements
- Scale-free brain functional networks
- Growing Scale-Free Networks with Tunable Clustering
- How to project a bipartite network?
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Correlated random networks
- Exact Solution for the Time Evolution of Network Rewiring Models
- Scale free networks from a Hamiltonian dynamics
- Exact Solutions for Network Rewiring Models
- Self Organized Scale-Free Networks from Merging and Regeneration
- Growing dynamics of Internet providers
- Self-tuning of threshold for a two-state system
Cited by in corpus (14)
- Link Prediction in Complex Networks: A Survey
- Predicting Missing Links via Local Information
- Exact Solution for the Time Evolution of Network Rewiring Models
- Memory and burstiness in dynamic networks
- Local rewiring rules for evolving complex networks
- S-curve networks and an approximate method for estimating degree distributions of complex networks
- Performance of Local Information Based Link Prediction: A Sampling Perspective
- Opinion dynamics over complex networks: kinetic modeling and numerical methods
- Exact Solutions for Models of Cultural Transmission and Network Rewiring
- A generalized theory of preferential linking
- Scale-free tree network with an ultra-large diameter
- Discrete Scale Invariance in Scale Free Graphs
- Network growth with preferential attachment and without "rich get richer" mechanism
- Towards Fast Evaluation of Unsupervised Link Prediction by Random Sampling Unobserved Links