Internet Mathematics

Nongrowing Preferential Attachment Random Graphs

Tomas Hruz and Ueli Peter

Full-text: Open access

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.

Article information

Source
Internet Math., Volume 6, Number 4 (2010), 461-487.

Dates
First available in Project Euclid: 13 October 2011

Permanent link to this document
https://projecteuclid.org/euclid.im/1318514518

Mathematical Reviews number (MathSciNet)
MR2809835

Zentralblatt MATH identifier
1237.05189

Citation

Hruz, Tomas; Peter, Ueli. Nongrowing Preferential Attachment Random Graphs. Internet Math. 6 (2010), no. 4, 461--487. https://projecteuclid.org/euclid.im/1318514518


Export citation