Random networks with concave preferential attachment rule

DOI10.1365/s13291-010-0011-6zbMath1217.05206OpenAlexW1965949399MaRDI QIDQ2431083

Peter Mörters, Steffen Dereich

Publication date: 8 April 2011

Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1365/s13291-010-0011-6

zbMATH Keywords

clusteringpercolationpreferential attachmentrandom networksgiant componentaverage distancesnonlinear preferential attachmenthub vertices

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items (6)

Typical Distances in Ultrasmall Random Networks ⋮ Local weak convergence for PageRank ⋮ MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ Locality of random digraphs on expanders ⋮ Metastability of the contact process on fast evolving scale-free networks ⋮ Spatial preferential attachment networks: power laws and clustering coefficients

This page was built for publication: Random networks with concave preferential attachment rule