A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Chernoff Bound for High-Dimensional Expanders
2020
International Workshop on Approximation Algorithms for Combinatorial Optimization
We generalize the expander Chernoff bound to high-dimensional expanders. The expander Chernoff bound is an essential property of expanders, first proved by Gillman [Gillman, 1993]. Given a graph G and a function f on the vertices, it states that the probability of f's mean sampled via a random walk on G to deviate from its actual mean, has a bound that depends on the spectral gap of the walk and decreases exponentially as the walk's length increases. We are interested in obtaining an analog
doi:10.4230/lipics.approx/random.2020.25
dblp:conf/approx/KaufmanS20
fatcat:rb3g5doekzf75nimvxk6bakd5y