An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model

zbMath1256.05223MaRDI QIDQ446267

Evgeniy Grechnikow

Publication date: 5 September 2012

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

random graphsdegree distributionpower lawscale-free graphsweb graphsBollobás-Riordan model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (3)

Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model ⋮ Small subgraphs in preferential attachment networks ⋮ General results on preferential attachment and clustering coefficient

This page was built for publication: An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model