16 search results - page 1 / 4 » Expander Properties and the Cover Time of Random Intersectio... |
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...