The phase transition in the evolution of random digraphs
暂无分享,去创建一个
Let (n, M) denote a digraph chosen at random from the family of all digraphs on n vertices with M arcs. We shall prove that if M/n ≤ c 1 the largest component of (n, M) is of the order n with probability 1 - o(1).
[1] P. Erdos,et al. On the evolution of random graphs , 1984 .
[2] B. Bollobás. The evolution of random graphs , 1984 .
[3] Robert E. Tarjan,et al. Linear Expected-Time Algorithms for Connectivity Problems , 1980, J. Algorithms.