36 citations · 196 across the 30 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.PR2020
Universality of cutoff for graphs with an added random matching
Jonathan Hermon, Allan Sly, Perla Sousi
We establish universality of cutoff for simple random walk on a class of random graphs defined as follows. Given a finite graph with even we define a random graph $…
math.PR2020★ 5 cited
Sensitivity of mixing times of Cayley graphs
Jonathan Hermon, Gady Kozma
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between th…