A random graph with a subcritical number of edges
A random graph with a subcritical number of edges
复制标题
具有亚临界边数的随机图
DOI：
10.1090/s0002-9947-1988-0957061-x
复制
发表时间：
1988
影响因子：
1.3
通讯作者：
B. Pittel
中科院分区：
文献类型：
--
作者：
B. Pittel
一个随机图Gn(prob(Edge)=p)(p=c/n，0ci/2j)为n-oo，该随机图没有长度为>；1的圈。另一个结果是，当v-oo且v=o(n/log5/2n)时，第Vth个最大分支的大小或者等于最接近Alog(bn/vlog5/2n)的整数，a=a(C)，b=b(C)，或者比这个整数小1。
A random graph Gn(prob(edge) = p) (p = c/n, 0 ci/2j) as n -oo, the random graph does not have a cycle of length > 1. Another result is that, with probability approaching 1, the size of the vth largest component either equals an integer closest to alog(bn/v log5/2 n), a = a(c), b = b(c), or is one less than this integer, provided that v -oo and v = o(n/ log5/2 n).