Abstract
We consider random graph with power-law degree distribution as a model
of communication networks. Previous results deal with asymtotic structure,
appearing only in the limit of arbitrary large number of nodes. In this work
we showed that the asymptotic regime is reached with reasonable rate of
convergence, provided that the degree distribution has fat-enough tail.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Complex Systems |
| Place of Publication | USA |
| Number of pages | 8 |
| Publication status | Published - 2008 |
| MoE publication type | B3 Non-refereed article in conference proceedings |
| Event | International Conference on Complex Systems - Boston, United States Duration: 27 Oct 2007 → 2 Nov 2007 |
Conference
| Conference | International Conference on Complex Systems |
|---|---|
| Country/Territory | United States |
| City | Boston |
| Period | 27/10/07 → 2/11/07 |
Keywords
- Communicatuion networks
- network topology
- random graphs