Random graph models of communication network topologies

Hannu Reittu, Ilkka Norros

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientific


    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 languageEnglish
    Title of host publicationProceedings of the International Conference on Complex Systems
    Place of PublicationUSA
    Number of pages8
    Publication statusPublished - 2008
    MoE publication typeB3 Non-refereed article in conference proceedings
    EventInternational Conference on Complex Systems - Boston, United States
    Duration: 27 Oct 20072 Nov 2007


    ConferenceInternational Conference on Complex Systems
    Country/TerritoryUnited States


    • Communicatuion networks
    • network topology
    • random graphs


    Dive into the research topics of 'Random graph models of communication network topologies'. Together they form a unique fingerprint.

    Cite this