A Sharp Tail Bound for the Expander Random Sampler

arXiv: Probability, Volume abs/1703.10205, 2017.

Cited by: 2|Bibtex|Views34|Links
EI

Abstract:

Consider an expander graph in which a $mu$ fraction of the vertices are marked. A random walk starts at a uniform vertex and at each step continues to a random neighbor. Gillman showed in 1993 that the number of marked vertices seen in a random walk of length $n$ is concentrated around its expectation, $Phi := mu n$, independent of the si...More

Code:

Data:

Your rating :
0

 

Tags
Comments