Went to the website of Prof. Joel Spencer, a professor from Dept. of Computer Science and Dept. of Mathematics in New York University.
Went to his page storing his talk slides. A quote from the slide for his talk in Tianjin in 2007:
is a graph with n vertices and random N(n) edges.The largest component of
is of order 
for 
, of order 
for
and of order n for 
.This double "jump" when c passes the value 1/2 is one of the most striking facts concerning random graphs.
No comments:
Post a Comment