Open Access
Translator Disclaimer
2010 Nongrowing Preferential Attachment Random Graphs
Tomas Hruz, Ueli Peter
Internet Math. 6(4): 461-487 (2010).

Abstract

We consider an edge rewiring process that is widely used to model the dynamics of scale-free weblike networks. This process uses preferential attachment and operates on sparse multigraphs with n vertices and m edges. We prove that its mixing time is optimal and develop a framework that simplifies the calculation of graph properties in the steady state. The applicability of this framework is demonstrated by calculating the degree distribution, the number of self-loops, and the threshold for the appearance of the giant component.

Citation

Download Citation

Tomas Hruz. Ueli Peter. "Nongrowing Preferential Attachment Random Graphs." Internet Math. 6 (4) 461 - 487, 2010.

Information

Published: 2010
First available in Project Euclid: 13 October 2011

zbMATH: 1237.05189
MathSciNet: MR2809835

Rights: Copyright © 2010 A K Peters, Ltd.

JOURNAL ARTICLE
27 PAGES


SHARE
Vol.6 • No. 4 • 2010
Back to Top