Concentration of vertex degrees in a scale‐free random graph process

DOI10.1002/rsa.20065zbMath1060.05086OpenAlexW4254037268MaRDI QIDQ4667864

Jerzy Szymański

Publication date: 21 April 2005

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20065

zbMATH Keywords

scale-free random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (7)

A preferential attachment model with random initial degrees ⋮ Branches in scale-free trees ⋮ From trees to graphs: collapsing continuous-time branching processes ⋮ Degree distribution of a scale-free random graph model ⋮ Subgraphs in preferential attachment models ⋮ The degree sequences of an asymmetrical growing network ⋮ Nonuniform recursive trees with vertex attraction depending on their labels

This page was built for publication: Concentration of vertex degrees in a scale‐free random graph process