Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

RSA
2008

favoriteEmaildiscussreport

118views more RSA 2008»

The cover time of the giant component of a random graph

13 years 3 months ago

The cover time of the giant component of a random graph

Download www.math.cmu.edu

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 particular we show that the cover time is not monotone for c = (ln n). We also determine the cover time of the k-cores, k 2.

Colin Cooper, Alan M. Frieze

Real-time Traffic

Cover Time | Largest Component | Random Walk | RSA 2008 |

claim paper

Related Content

» Embracing the Giant Component

» Birth control for giants

» Giant Component and Connectivity in Geographical Threshold Graphs

» The Size of the Giant Component of a Random Graph with a Given Degree Sequence

» The Giant Component in a Random Subgraph of a Given Graph

» Component structure induced by a random walk on a random graph

» Ramsey games with giants

» Random 2SAT with Prescribed Literal Degrees

» Sparse random graphs with clustering

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	RSA
Authors	Colin Cooper, Alan M. Frieze

Comments (0)