RANDOM GRAPH PROCESSES WITH MAXIMUM DEGREE 2
成果类型：
Article
署名作者：
Rucinski, A.; Wormald, N. C.
署名单位：
Adam Mickiewicz University; University of Melbourne
刊物名称：
ANNALS OF APPLIED PROBABILITY
ISSN/ISSBN：
1050-5164
发表日期：
1997
页码：
183-199
关键词：
摘要：
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 -> infinity, 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.