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

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 agains...

Full description

Saved in:
Bibliographic Details
Published in:IEEE network 2008-03, Vol.22 (2), p.40-46
Main Authors: Norros, I., Reittu, H.
Format: Article
Language:English
Subjects:
Analogies
Architecture
Computer simulation
Construction
Graphs
Gravity
Heart
Hierarchies
Internet
Large-scale systems
Networks
Power law
Random variables
Robustness
Scalability
Stochastic processes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0890-8044
1558-156X
DOI:10.1109/MNET.2008.4476070