### Abstract

A general class of growing networks is constructed with both preferential and random attachments, which includes random and scale-free networks as limiting cases when a physical parameter is tuned. Formulas are derived characterizing the evolution and distribution of the connectivity, which are verified by numerical computations. Study of. the effect of random failures and intentional attacks on the performance of network suggests that general networks which are neither completely random nor scale-free are desirable. (C) 2002 Elsevier Science B.V. All rights reserved.

Original language | English |
---|---|

Pages (from-to) | 337-344 |

Number of pages | 8 |

Journal | Physics Letters A |

Volume | 303 |

Issue number | 5-6 |

Publication status | Published - 28 Oct 2002 |

### Keywords

- WORLD-WIDE-WEB
- GROWING RANDOM NETWORKS
- EVOLVING NETWORKS
- COMPLEX NETWORKS
- DYNAMICS
- TOPOLOGY
- INTERNET
- GROWTH

## Cite this

Liu, Z. H., Lai, Y. C., Ye, N., Dasgupta, P., & Lai, Y-C. (2002). Connectivity distribution and attack tolerance of general networks with both preferential and random attachments.

*Physics Letters A*,*303*(5-6), 337-344.