By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Norros, I. ; Finland Tech. Res. Centre, Espoo ; Reittu, H.

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.

Published in:

Network, IEEE  (Volume:22 ,  Issue: 2 )