215 citations
- Microsoft (United States)US16 papers
- University of CambridgeGB7 papers
- Massachusetts Institute of TechnologyUS6 papers
- Tel Aviv UniversityIL5 papers
- University of California, BerkeleyUS5 papers
- Johns Hopkins UniversityUS4 papers
- Microsoft Research New England (United States)US4 papers
- University of ChicagoUS4 papers
- University of WashingtonUS4 papers
- Stanford UniversityUS3 papers
- Technion – Israel Institute of TechnologyIL3 papers
- University of British ColumbiaCA3 papers
Showing 2013 · math.PRShow all
2 papers · 2 filters
math.PR2013
Sensitivity of mixing times
Jian Ding, Yuval Peres
In this note, we demonstrate an instance of bounded-degree graphs of size , for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \l…
math.PR2013★ 7 cited
Convergent sequences of sparse graphs: A large deviations approach
Christian Borgs, Jennifer Chayes, David Gamarnik
In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The n…