Kinetic Theory of Random Graphs
Statistical Mechanics
2007-05-23 v1 Disordered Systems and Neural Networks
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.
Cite
@article{arxiv.cond-mat/0503420,
title = {Kinetic Theory of Random Graphs},
author = {E. Ben-Naim and P. L. Krapivsky},
journal= {arXiv preprint arXiv:cond-mat/0503420},
year = {2007}
}
Comments
11 pages, short review