On limit behavior of maximum vertex degree in a conditional configuration graph near critical points

DOI10.1515/DMA-2017-0023zbMath1377.05179OpenAlexW2750235917MaRDI QIDQ1692737

Elena V. Feklistova, Yuriy L. Pavlov

Publication date: 10 January 2018

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

Full work available at URL: https://doi.org/10.1515/dma-2017-0023

zbMATH Keywords

critical pointlimit theoremsrandom graphpower-law distributionmaximum vertex degreeconfiguration graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• The diameter of a scale-free random graph
• Limit distributions of the number of loops in a random configuration graph
• On conditional Internet graphs whose vertex degrees have no mathematical expectation
• Emergence of Scaling in Random Networks
• Random graphs of Internet type and the generalised allocation scheme
• A random graph model for massive graphs
• On the limit distributions of the vertex degrees of conditional Internet graphs
• Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region
• The Structure and Function of Complex Networks
• Random graph models of social networks
• Collective dynamics of ‘small-world’ networks
• The limit distribution of the size of a giant component in an Internet-type random graph

This page was built for publication: On limit behavior of maximum vertex degree in a conditional configuration graph near critical points