Kinetic Theory of Random Graphs
arXiv:cond-mat/0503420 · doi:10.1063/1.1985373
Abstract
Statistical properties of evolving random graphs are analyzed using kinetic theory. Treating the linking process dynamically, structural characteristics such as links, paths, cycles, and components are obtained analytically using the rate equation approach. Scaling laws for finite systems are derived using extreme statistics and scaling arguments.
11 pages, short review