10 citations · 10 across the 5 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2003
Waiting for a bat to fly by (in polynomial time)
Itai Benjamini, Gady Kozma, Laszlo Lovasz +2
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans…
math.PR2002
Determining the Genus of a Map by Local Observation of a Simple Random Process
Itai Benjamini, Laszlo Lovasz
Given a graph embedded in an orientable surface, a process consisting of random excitations and random node and face balancing is constructed and analyzed. It is shown that given a…
math.PR2000
The cover time, the blanket time, and the Matthews bound
J. Kahn, J. H. Kim, L. Lovasz +1
The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time t…