55 citations · 314 across the 46 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
cs.DS2008★ 1 cited
Finding Sparse Cuts Locally Using Evolving Sets
Reid Andersen, Yuval Peres
A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph , starting from a spe…
math.CA2008★ 9 cited
The power law for the Buffon needle probability of the four-corner Cantor set
Fedor Nazarov, Yuval Peres, Alexander Volberg
Let be the -th generation in the construction of the middle-half Cantor set. The Cartesian square of consists of squares of side-length . The cha…
math.PR2008
Total-variation cutoff in birth-and-death chains
Jian Ding, Eyal Lubetzky, Yuval Peres
The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence to stationarity. In 1996, Diaconis surveyed this phenomenon, and asked ho…