Nongrowing Preferential Attachment Random Graphs

DOI10.1080/15427951.2010.553143zbMath1237.05189OpenAlexW2132287883MaRDI QIDQ2885315

Tomas Hruz, Ueli Peter

Publication date: 22 May 2012

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1318514518

zbMATH Keywords

mixing timedegree distributionpreferential attachmentgiant componentedge rewiring processnumber of self-loopssparse multigraphsweblike networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Vertex degrees (05C07)

Related Items (1)

Preferential attachment without vertex growth: emergence of the giant component

This page was built for publication: Nongrowing Preferential Attachment Random Graphs