Random graph processes with maximum degree $2$
Ruciński, A. ; Wormald, N. C.
Ann. Appl. Probab., Tome 7 (1997) no. 1, p. 183-199 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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 \to \infty$, 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 $(1 \geq 3)$, and other aspects of this random graph model are studied.
Publié le : 1997-02-14
Classification:  Generation algorithms,  number of cycles,  limiting distributions,  05C80,  05C85 
@article{1034625259,
     author = {Ruci\'nski, A. and Wormald, N. C.},
     title = {Random graph processes with maximum degree $2$},
     journal = {Ann. Appl. Probab.},
     volume = {7},
     number = {1},
     year = {1997},
     pages = { 183-199},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1034625259}
}

Ruciński, A.; Wormald, N. C. Random graph processes with maximum degree $2$. Ann. Appl. Probab., Tome 7 (1997) no. 1, pp.  183-199. http://gdmltest.u-ga.fr/item/1034625259/