On the distribution of the maximum k-degrees of the binomial random graph
From MaRDI portal
Publication:1732072
DOI10.1134/S1064562418070268zbMATH Open1407.05213OpenAlexW2910633281MaRDI QIDQ1732072FDOQ1732072
Authors: 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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Vertex degrees (05C07)
Cites Work
- Extremes and related properties of random sequences and processes
- Title not available (Why is that?)
- Asymptotics of maxima of discrete random variables
- Random graphs.
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Random graphs: models and asymptotic characteristics
- The distribution of the maximum degree of a random graph
- Degree sequences of random graphs
- The Janson inequalities for general up-sets
Cited In (10)
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- On the limit distributions of the degrees of vertices in configuration graphs with a bounded number of edges
- The distribution of extremes in the degree sequence: A Gumbel distribution approach
- Maximum number of symmetric extensions in random graphs
- A Gumbel distribution approach of extremes in the degree sequence
- Analytical results for the distribution of cover times of random walks on random regular graphs
- The maximum and minimum degrees of random bipartite multigraphs
- The distribution of the maximum number of common neighbors in the random graph
- Title not available (Why is that?)
- On the limiting distribution of a graph scan statistic
This page was built for publication: On the distribution of the maximum \(k\)-degrees of the binomial random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732072)