Kinetic Theory of Random Graphs
classification
❄️ cond-mat.stat-mech
cond-mat.dis-nn
keywords
graphskineticrandomscalingtheoryanalyticallyanalyzedapproach
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.