Connectivity of growing random networks.

@article{Krapivsky2000ConnectivityOG,
  title={Connectivity of growing random networks.},
  author={Paul L. Krapivsky and Sidney Redner and Francois Leyvraz},
  journal={Physical review letters},
  year={2000},
  volume={85 21},
  pages={
          4629-32
        }
}
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites that link to earlier sites with a probability A(k) which depends on the number of preexisting links k to that site. For homogeneous connection kernels, A(k) approximately k(gamma), different behaviors arise for gamma<1, gamma>1, and gamma = 1. For gamma<1, the number of sites with k links, N(k), varies as a stretched exponential. For gamma>1, a… Expand

Figures from this paper

Structure of growing networks with preferential linking.
TLDR
The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal. Expand
Connectivity of growing networks with link constraints
AbstractWe propose a growing network model with link constraint, in which new nodes are continuously introduced into the system and immediately connected to preexisting nodes, and any arbitrary nodeExpand
Degree-dependent intervertex separation in complex networks.
TLDR
The mean length (l)(k) of the shortest paths between a vertex of degree k and other vertices in growing networks, where correlations are essential, is studied to compare with those for uncorrelated graphs. Expand
Scale-free networks with tunable degree-distribution exponents.
  • H. Lee, H. Chan, P. Hui
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
A model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent is proposed and found to be in good agreement with results obtained by extensive numerical simulations. Expand
Distinct Degrees and Their Distribution in Complex Networks
We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of aExpand
Scaling exponents and clustering coefficients of a growing random network.
  • Haijun Zhou
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
TLDR
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner, and various clustering coefficients are calculated, indicating that the network resembles a small world. Expand
Evolving networks with disadvantaged long-range connections.
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, theExpand
Scaling in weighted networks and complex systems
Network systems evolving by preferential attachment of new vertices and by link loading are considered. The probability of node attaching is assumed to depend linearly on degrees of existing nodes toExpand
Weighted scale-free networks with stochastic weight assignments.
TLDR
A model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node is proposed, demonstrating a power-law distribution with an exponent sigma that depends on the probability p. Expand
On the emergence of scaling in weighted networks
General conditions for the appearance of the power-law distribution of total weights concentrated in vertices of complex network systems are established. By use of the rate equation approach forExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
Social Network Analysis
This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is arguedExpand
Origins of Order: self-organization and selection in evolution
TLDR
The structure of rugged fitness landscapes and the structure of adaptive landscapes underlying protein evolution, and the architecture of genetic regulatory circuits and its evolution. Expand
Comput
  • Netw. 33, 309
  • 2000
Comput. Netw
  • Comput. Netw
  • 2000
Phys
  • Rev. E 62, 1842
  • 2000
Phys. Rev. E
  • Phys. Rev. E
  • 2000
and A
  • Rucinski, Random Graphs
  • 2000
Proceedings of the 25th Very Large Databases Conference
  • Proceedings of the 25th Very Large Databases Conference
  • 1999
Proceedings of the International Conference on Combinatorics and Computing
  • Proceedings of the International Conference on Combinatorics and Computing
  • 1999
...
1
2
3
4
...