83 search results - page 1 / 17 » The cover time of the giant component of a random graph |
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 ...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
COMBINATORICA
2007
13 years 4 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...
WAW
2007
Springer
13 years 11 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
CPC
1998
13 years 4 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...