Suppose that a process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always at most 2. In a previous article, the authors showed that as n → ∞, with probability tending to 1, the result of this process is a graph with n edges. The number of l-cycles in this graph is shown to be asymptotically Poisson (l ≥ 3), and other aspects of this random graph model are studied.
|Number of pages||17|
|Journal||Annals of Applied Probability|
|Publication status||Published - Feb 1997|
- Generation algorithms
- Limiting distributions
- Number of cycles