Kinetic theory of random graphs: From paths to cycles
Kinetic theory of random graphs: From paths to cycles
The structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically. At the gelation point, the typical length of paths and cycles, l , scales with …