activity
20012026
most citedCritical random graphs: Diameter and mixing time

113 citations · 561 across the 82 of their papers we have counts for

collaborators
Showing 2017Show all

8 papers · 1 filter

math.ST2017

Mixing time estimation in reversible Markov chains from a single sample path

Daniel Hsu, Aryeh Kontorovich, David A. Levin +2

The spectral gap of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matri…

math.PR2017

Trace reconstruction with varying deletion probabilities

Lisa Hartung, Nina Holden, Yuval Peres

In the trace reconstruction problem an unknown string is observed through the deletion channel, which deletes each with a ce…

cs.DS2017

Average-case reconstruction for the deletion channel: subpolynomially many traces suffice

Yuval Peres, Alex Zhai

The deletion channel takes as input a bit string , and deletes each bit independently with probability , yielding a shorter string. The trace reconstru…

math.PR2017

Mixing time for random walk on supercritical dynamical percolation

Yuval Peres, Perla Sousi, Jeffrey E. Steif

We consider dynamical percolation on the -dimensional discrete torus of side length , , where each edge refreshes its status at rate to be open…

math.PR20174 cited

Quenched exit times for random walk on dynamical percolation

Yuval Peres, Perla Sousi, Jeffrey E. Steif

We consider random walk on dynamical percolation on the discrete torus . In previous work, mixing times of this process for were obtained in t…

math.PR2017

Concentration inequalities for polynomials of contracting Ising models

Reza Gheissari, Eyal Lubetzky, Yuval Peres

We study the concentration of a degree- polynomial of the spins of a general Ising model, in the regime where single-site Glauber dynamics is contracting. For , Gaussia…