On the distribution of the maximum k-degrees of the binomial random graph
From MaRDI portal
(Redirected from Publication:1732072)
On the distribution of the maximum \(k\)-degrees of the binomial random graph
On the distribution of the maximum \(k\)-degrees of the binomial random graph
Recommendations
Cites work
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Asymptotics of maxima of discrete random variables
- Degree sequences of random graphs
- Extremes and related properties of random sequences and processes
- Random graphs.
- Random graphs: models and asymptotic characteristics
- The Janson inequalities for general up-sets
- The distribution of the maximum degree of a random graph
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(10)- On the limiting distribution of a graph scan statistic
- 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
- scientific article; zbMATH DE number 4179410 (Why is no real title available?)
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)