Open Access
Translator Disclaimer
2003 Coupling Scale-Free and Classical Random Graphs
Béla Bollobás, Oliver Riordan
Internet Math. 1(2): 215-225 (2003).

Abstract

Recently many new "scale-free'' random graph models have been introduced, motivated by the power-law degree sequences observed in many large-scale real-world networks. The most studied of these is the Barabási-Albert growth with "preferential attachment'' model, made precise as the LCD model by the present authors. Here we use coupling techniques to show that in certain ways the LCD model is not too far from a standard random graph; in particular, the fractions of vertices that must be retained under an optimal attack in order to keep a giant component are within a constant factor for the scale-free and classical models.

Citation

Download Citation

Béla Bollobás. Oliver Riordan. "Coupling Scale-Free and Classical Random Graphs." Internet Math. 1 (2) 215 - 225, 2003.

Information

Published: 2003
First available in Project Euclid: 7 July 2004

zbMATH: 1061.05084
MathSciNet: MR2077226

Rights: Copyright © 2003 A K Peters, Ltd.

JOURNAL ARTICLE
11 PAGES


SHARE
Vol.1 • No. 2 • 2003
Back to Top