Nongrowing preferential attachment random graphs

DOI10.1080/15427951.2010.553143MaRDI QIDQ2885315zbMATH OpenOpenAlexFDO

Authors 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

degree distributionedge rewiring processgiant componentmixing timenumber of self-loopspreferential attachmentsparse multigraphsweblike networks

Mathematics Subject Classification ID

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

Recommendations

• Growth of preferential attachment random graphs via continuous-time branching processes
• Scale-free property for degrees and weights in a preferential attachment random graph model
• A Geometric Preferential Attachment Model of Networks
• The degree sequence of a scale-free random graph process
• Random Deletion in a Scale-Free Random Graph Process

Cited in

(5)

• Parameter specification for the degree distribution of simulated Barabási-Albert graphs
• On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
• Fragility of nonconvergence in preferential attachment graphs with three types
• Preferential attachment without vertex growth: emergence of the giant component
• Techniques for analyzing dynamic random graph models of web-like networks: An overview

This page was built for publication: Nongrowing preferential attachment random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885315)