On the Asymptotic Behavior of Degrees of Vertices in a Random Graph

DOI10.1137/1118020zbMATH Open0294.60009OpenAlexW1996693404MaRDI QIDQ4046817FDOQ4046817

Author name not available (Why is that?)

Publication date: 1973

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1118020

Mathematics Subject Classification ID

Probability theory on algebraic and topological structures (60B99) Combinatorial probability (60C05) Graph theory (05C99)

Cited In (14)

• A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method
• Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph
• The asymptotic value of the Randić index for trees
• Maximum number of symmetric extensions in random graphs
• Some remarks about extreme degrees in a random graph
• Concentration of maximum degree in random planar graphs
• Applications of the variance of final outbreak size for disease spreading in networks
• The degree distribution of the random multigraphs
• Survey sampling in graphs
• Extremal independence in discrete random systems
• The distribution of the maximum number of common neighbors in the random graph
• The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs
• Rulers and slaves in a random social group
• Extreme degrees in random subgraphs of regular graphs

This page was built for publication: On the Asymptotic Behavior of Degrees of Vertices in a Random Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4046817)