Network models with a 'soft hierarchy': A random graph construction with loglog scalability

Ilkka Norros, Hannu Reittu

Research output: Contribution to journalArticleScientificpeer-review

11 Citations (Scopus)


Power law random graphs with infinite variance degree distribution are shown to possess a fascinating architecture with a softly hierarchical core network. The core provides loglog-scalable connectivity properties for the whole giant component of the graph. The core is also shown to be robust against attacks to the very heart of the architecture, the top layers of the hierarchy. The structure's similarities and dissimilarities with the Internet's autonomous system graph are discussed. The main significance of a soft hierarchy is seen, however, in the context of structural aspects of large future networks.
Original languageEnglish
Pages (from-to)40-46
Number of pages7
JournalIEEE Network
Issue number2
Publication statusPublished - 2008
MoE publication typeA1 Journal article-refereed



  • power law
  • power law random graphs
  • PLRG
  • networks
  • network architecture
  • internet

Cite this