On the limit distributions of the vertex degrees of conditional Internet graphs

DOI10.1515/DMA.2009.023zbMath1237.05194OpenAlexW2019673367MaRDI QIDQ3225881

Yuriy L. Pavlov

Publication date: 23 March 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2009.023

zbMATH Keywords

large data transmission networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Internet topics (68M11)

Related Items (8)

Some limit theorems for the cell load in the generalized allocation scheme ⋮ On limit behavior of maximum vertex degree in a conditional configuration graph near critical points ⋮ The Study of the Statistical Characteristics of the Text Based on the Graph Model of the Linguistic Corpus ⋮ On extremal indices greater than one for a scheme of series ⋮ On conditional Internet graphs whose vertex degrees have no mathematical expectation ⋮ On the connectivity of configuration graphs ⋮ On the asymptotics of degree structure of configuration graphs with bounded number of edges ⋮ Activity maxima in some models of information networks with random weights and heavy tails

Cites Work

• Local Limit Theorems for Lattice Random Variables
• Random graphs of Internet type and the generalised allocation scheme
• On limit theorems for the generalised allocation scheme
• The limit distribution of the size of a giant component in an Internet-type random graph
• Note on the Bose-Einstein Integral Functions

This page was built for publication: On the limit distributions of the vertex degrees of conditional Internet graphs