Open Access
Translator Disclaimer
2008 Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region
Ilkka Norros, Hannu Reittu
Internet Math. 5(3): 251-266 (2008).

Abstract

We consider a conditionally Poisson random-graph model in which the mean degrees, ``capacities,'' follow a power-tail distribution with finite mean and infinite variance. Such a graph of size $N$ has a giant component that is supersmall in the sense that the typical distance between vertices is of order $\log\log N$. The shortest paths travel through a core consisting of nodes with high mean degrees. In this paper we derive upper bounds for the distance between two random vertices when an upper part of the core is removed, including the case that the whole core is removed.

Citation

Download Citation

Ilkka Norros. Hannu Reittu. "Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region." Internet Math. 5 (3) 251 - 266, 2008.

Information

Published: 2008
First available in Project Euclid: 24 November 2009

zbMATH: 1184.68360
MathSciNet: MR2573955

Rights: Copyright © 2008 A K Peters, Ltd.

JOURNAL ARTICLE
16 PAGES


SHARE
Vol.5 • No. 3 • 2008
Back to Top