K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases

Simple item page
dc.creatorAlvarez-Hamelin, José Ignacio
dc.creatorDall'Asta, Luca
dc.creatorBarrat, Alain
dc.creatorVespignani, Alessandro
dc.date2005-11-02
dc.date2008-04-16
dc.date.accessioned2026-07-07T09:32:45Z
dc.date.available2026-07-07T09:32:45Z
dc.descriptionWe consider the $k$-core decomposition of network models and Internet graphs at the autonomous system (AS) level. The $k$-core analysis allows to characterize networks beyond the degree distribution and uncover structural properties and hierarchies due to the specific architecture of the system. We compare the $k$-core structure obtained for AS graphs with those of several network models and discuss the differences and similarities with the real Internet architecture. The presence of biases and the incompleteness of the real maps are discussed and their effect on the $k$-core analysis is assessed with numerical experiments simulating biased exploration on a wide range of network models. We find that the $k$-core analysis provides an interesting characterization of the fluctuations and incompleteness of maps as well as information helping to discriminate the original underlying structure.
dc.identifierhttps://arxiv.org/abs/cs/0511007
dc.identifierhttp://arxiv.org/abs/cs/0511007
dc.identifierNetworks and Heterogeneous Media 3 (2008) 371
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158890
dc.subjectNetworking and Internet Architecture
dc.subjectStatistical Mechanics
dc.titleK-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases
dc.typetext

Files

Collections

arXiv