# Growing a network on a given substrate

@article{Fotouhi2012GrowingAN, title={Growing a network on a given substrate}, author={Babak Fotouhi and Michael G. Rabbat}, journal={2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)}, year={2012}, pages={2018-2023} }

Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the degree distribution is the center of attention. We consider two specific growth models; incoming nodes with uniform and preferential attachment, and the degree distribution of the graph for arbitrary initial condition is obtained as a function of time. This…

## 27 References

### Structure of growing networks with preferential linking.

- 2000

Mathematics

Physical review letters

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.

### Organization of growing random networks.

- 2001

Computer Science

Physical review. E, Statistical, nonlinear, and soft matter physics

The organizational development of growing random networks is investigated, and the combined age and degree distribution of nodes shows that old nodes typically have a large degree.

### Emergence of scaling in random networks

- 1999

Computer Science

Science

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.

### Connectivity of growing random networks.

- 2000

Mathematics

Physical review letters

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.

### Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model

- 2000

Mathematics

We generalize the Barab´asi–Albert’s model of growing networks accounting for initial properties of sites and ﬁnd exactly the distribution of connectivities of the network P ( q ) and the averaged…

### Finiteness and fluctuations in growing networks

- 2002

Computer Science

It is argued that fluctuations in the number of nodes of degree k become Gaussian for fixed degree as the size of the network diverges and the fluctuations between different realizations are characterized in terms of higher moments of the degree distribution.

### The Structure and Function of Complex Networks

- 2003

Computer Science

SIAM Rev.

Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

### A Noncooperative Model of Network Formation

- 2000

Computer Science

An approach to network formation based on the notion that social networks are formed by individual decisions that trade off the costs of forming and maintaining links against the potential rewards from doing so to formulate the network formation process as a noncooperative game.