# Structure of growing networks with preferential linking.

@article{Dorogovtsev2000StructureOG, title={Structure of growing networks with preferential linking.}, author={Sergey N. Dorogovtsev and Jos{\'e} F. F. Mendes and Alexander N. Samukhin}, journal={Physical review letters}, year={2000}, volume={85 21}, pages={ 4633-6 } }

The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites. We find the exact form of the stationary distribution of the number of incoming links of sites in the limit of long times, P(q), and the long-time limit of the average connectivity q(s,t) of a site s at time t (one site is added per unit of time). At long times, P(q) approximately q(-gamma) at q-->infinity and q(s,t) approximately (s/t)(-beta) at s/t-->0, where…

## 1,086 Citations

### Effects of preference for attachment to low-degree nodes on the degree distributions of a growing directed network and a simple food-web model.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2006

This work proposes a preferential-attachment scheme, in which a new node attaches to an existing node i with probability II(k(i)) approximately k(-1), where k(i) is the number of outgoing links at i, and calculates the degree distribution for the outgoing links in the asymptotic regime t --> infinity, n(k).

### Effect of Accelerated Growth on Networks Dynamics

- Computer Science
- 2003

It is shown that the accelerated growth fairly well explains the structure of the Word Web (the network of interacting words of human language) and its features applying it to simple illustrating examples.

### Evolving networks with disadvantaged long-range connections.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002

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, the…

### Power-law accelerating growth complex networks with mixed attachment mechanisms

- Computer Science
- 2012

### Time evolution of the degree distribution of model A of random attachment growing networks

- Computer Science
- 2007

### Growing networks with mixed attachment mechanisms

- Computer Science
- 2006

It has been found that degree distribution possesses this extended power-law form for many real networks, such as the movie actor network, the citation network of scientific papers and diverse protein interaction networks.

### Generation of scale-free networks using a simple preferential-rewiring dynamics

- Computer Science
- 2007

### Scale-free networks with tunable degree-distribution exponents.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2004

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.

### Preferential attachment network model with aging and initial attractiveness

- Computer ScienceCommunications in Theoretical Physics
- 2022

This paper generalizes the growing network model with preferential attachment for new links to simultaneously include aging and initial attractiveness of nodes and presents a mean-field analysis that predicts the degree dynamics of the network structure.

## References

SHOWING 1-10 OF 55 REFERENCES

### Connectivity of growing random networks.

- MathematicsPhysical review letters
- 2000

A solution for the time- and age-dependent connectivity distribution of a growing random network is presented and the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2.

### Evolution of networks with aging of sites

- MathematicsPhysical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
- 2000

It is found both from simulation and analytically that the network shows scaling behavior only in the region alpha<1, when alpha increases from -infinity to 0, and the exponent gamma of the distribution of connectivities grows from 2 to the value for the network without aging.

### Exactly solvable small-world network

- Mathematics
- 2000

We present an exact description of a crossover between two different regimes of simple small-world networks. Each of the sites chosen with a probability p from n sites of an ordered system defined on…

### Emergence of scaling in random networks

- Computer ScienceScience
- 1999

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

### Renormalization Group Analysis of the Small-World Network Model

- Physics, Computer Science
- 1999

### On the properties of small-world network models

- Physics
- 1999

Abstract:We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties…

### Small worlds

- Computer Science, MathematicsRandom Struct. Algorithms
- 2001

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.

### Phase Transitions in Two-Dimensional Kauffman Cellular Automata

- Computer Science
- 1986

This work considers the random Boolean networks suggested by Kauffman mostly on a square lattice with nearest-neighbour interactions, and finds the phase transition observed in the overlap of configurations differing in the initial conditions is related to directed percolation on the body-centred cubic lattice.

### Internet: Growth dynamics of the World-Wide Web

- Computer ScienceNature
- 1999

It is found that web pages are distributed among sites according to a universal power law: many sites have only a few pages, whereas very few sites have hundreds of thousands of pages.