For simple random walk on a N-vertex graph, the mean time to cover all vertices is at least
cN log (N), where c> 0 is an absolute constant. This is deduced from a more general result …

This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

View an n-vertex, m-edge undirected graph as an electrical network with unit resistors as
edges. We extend known relations between random walks and electrical networks by …

A random walk on a finite graph can be used to construct a uniform random spanning tree. It
is shown how random walk techniques can be applied to the study of several properties of …

Laplace eigenvalues of graphs-a survey Page 1 Discrete Mathematics !09 (19Y2) 171-183
North-Holland 171 Laplace eigenvalues of graphs-a survey Bojan Mohar* University of …

Abstract Let f (x 1,…, xk) be a Boolean function that k parties wish to collaboratively evaluate,
where each xi is a bit-string of length n. The ith party knows each input argument except xi; …

In the last decade many important applications of eigenvalues and eigenvectors of graphs in
combinatorial optimization were discovered. The number and importance of these results is …

1 Introduction Page 1 A Tight Lower Bound on the Cover Time for Random Walks on Graphs
Uriel Feige May 4, 2000 Abstract We prove that the expected time for a random walk to cover …

We exhibit a strong connection between cover times of graphs, Gaussian processes, and
Talagrand's theory of majorizing measures. In particular, we show that the cover time of any …

It is pointed out that the complexity of next-generation VLSI systems will exceed the
capabilities of top-down layout synthesis algorithms, particularly in netlist partitioning and …