k-core decomposition: a tool for the analysis of large scale Internet graphs

@article{AlvarezHamelin2005kcoreDA,
  title={k-core decomposition: a tool for the analysis of large scale Internet graphs},
  author={Jos{\'e} Ignacio Alvarez-Hamelin and Luca Dall'Asta and Alain Barrat and Alessandro Vespignani},
  journal={CoRR},
  year={2005},
  volume={abs/cs/0511007}
}
We use the k-core decomposition, based on a recursive pruning of the least connected vertices, to study large scale Internet graphs at the Autonomous System level. This approach allows the characterization of progressively central cores of networks, conveniently uncovering hierarchical and structural properties. Internet maps show the noticeable property of having all k-cores consisting of a single connected component with invariant statistical properties (degree distribution, correlation… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…