51 search results - page 2 / 11 » Embracing the Giant Component |
RSA
2008
13 years 4 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
RSA
2010
13 years 3 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
COMBINATORICA
2007
13 years 5 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
RSA
2011
13 years 6 days ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
ALGORITHMICA
2007
13 years 5 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...