  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.
