Random graphs with arbitrary degree distributions and their applications

Random graphs with arbitrary degree distributions and their applications

7 May 2001 | M. E. J. Newman1,2, S. H. Strogatz2,3, and D. J. Watts1,4
The paper by Newman, Strogatz, and Watts develops the theory of random graphs with arbitrary degree distributions, extending the traditional Poisson distribution commonly used in random graph theory. The authors focus on both undirected and directed graphs, as well as bipartite graphs, and derive exact expressions for various properties such as the phase transition to a giant component, mean component size, and average vertex-vertex distances. They apply their theory to real-world networks, including the World Wide Web and collaboration networks, demonstrating that random graphs with appropriate degree distributions can accurately predict the behavior of these networks in some cases, while showing discrepancies in others, possibly indicating underlying social structures not captured by random graph models. The paper also introduces generating functions as a tool to calculate these properties and provides detailed derivations for specific examples, such as Poisson, exponential, and power-law degree distributions. Additionally, it discusses the challenges and implications of directed graphs and bipartite graphs, and includes simulation results to validate the theoretical findings.The paper by Newman, Strogatz, and Watts develops the theory of random graphs with arbitrary degree distributions, extending the traditional Poisson distribution commonly used in random graph theory. The authors focus on both undirected and directed graphs, as well as bipartite graphs, and derive exact expressions for various properties such as the phase transition to a giant component, mean component size, and average vertex-vertex distances. They apply their theory to real-world networks, including the World Wide Web and collaboration networks, demonstrating that random graphs with appropriate degree distributions can accurately predict the behavior of these networks in some cases, while showing discrepancies in others, possibly indicating underlying social structures not captured by random graph models. The paper also introduces generating functions as a tool to calculate these properties and provides detailed derivations for specific examples, such as Poisson, exponential, and power-law degree distributions. Additionally, it discusses the challenges and implications of directed graphs and bipartite graphs, and includes simulation results to validate the theoretical findings.
Reach us at info@study.space