On the distribution of the maximum \(k\)-degrees of the binomial random graph

DOI10.1134/S1064562418070268zbMath1407.05213OpenAlexW2910633281MaRDI QIDQ1732072

M. E. Zhukovskii, Igor V. Rodionov

Publication date: 15 March 2019

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

Full work available at URL: https://doi.org/10.1134/s1064562418070268

zbMATH Keywords

independent random variablesstandard Gumbel distribution

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex degrees (05C07)

Related Items (2)

Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ Maximum sparse induced subgraphs of the binomial random graph with given number of edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremes and related properties of random sequences and processes
• The distribution of the maximum degree of a random graph
• Degree sequences of random graphs
• Asymptotics of maxima of discrete random variables
• The Janson inequalities for general up‐sets
• Random graphs: models and asymptotic characteristics

This page was built for publication: On the distribution of the maximum \(k\)-degrees of the binomial random graph