Random graphs of Internet type and the generalised allocation scheme

DOI10.1515/DMA.2008.033zbMath1171.05419MaRDI QIDQ3184558

I. A. Cheplyukova, Yuriy L. Pavlov

Publication date: 21 October 2009

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Discrete location and assignment (90B80)

Related Items (9)

Conditional configuration graphs with discrete power-law distribution of vertex degrees ⋮ Some limit theorems for the cell load in the generalized allocation scheme ⋮ On the limit distributions of the vertex degrees of conditional Internet graphs ⋮ 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 conditional Internet graphs whose vertex degrees have no mathematical expectation ⋮ Limit Distributions of the Number of Vertices of a Given Degree in a Configuration Graph with Bounded Number of Edges ⋮ On the connectivity of configuration graphs ⋮ On the asymptotics of degree structure of configuration graphs with bounded number of edges

Cites Work

• Local Limit Theorems for Lattice Random Variables
• On limit theorems for the generalised allocation scheme
• On transition of distributions of sums of independent identically distributed random variables from one lattice to another in the generalised allocation scheme
• The limit distribution of the size of a giant component in an Internet-type random graph

This page was built for publication: Random graphs of Internet type and the generalised allocation scheme