Degree Distribution and Number of Edges between Nodes of Given Degrees in the Buckley–Osthus Model of a Random Web Graph

DOI10.1080/15427951.2011.646176zbMath1258.05112arXiv1108.4054OpenAlexW1998954244MaRDI QIDQ4905100

Evgeniy A. Grechnikov

Publication date: 15 February 2013

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

Full work available at URL: https://arxiv.org/abs/1108.4054

zbMATH Keywords

random graphsecond moment methodBuckley-Osthus modelBollobas-Riordan modelinitial attractiveness of a noderandom web graphtight concentation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (4)

Small subgraphs in preferential attachment networks ⋮ General results on preferential attachment and clustering coefficient ⋮ Degree-degree distribution in a power law random intersection graph with clustering ⋮ The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs

This page was built for publication: Degree Distribution and Number of Edges between Nodes of Given Degrees in the Buckley–Osthus Model of a Random Web Graph