activity
20142026
most citedCharacterization of cutoff for reversible Markov chains

36 citations · 196 across the 30 of their papers we have counts for

collaborators
Showing 2019Show all

8 papers · 1 filter

math.PR2019★ 1 cited

Further Results and Discussions on Random Cayley Graphs

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite group with respect to generators chosen uniformly at random, with . The results of this article supp…

math.PR2019★ 7 cited

Cutoff for Random Walks on Upper Triangular Matrices

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite group with respect to generators chosen uniformly at random, with (ie ). A co…

math.PR2019

Some inequalities for reversible Markov chains and branching random walks via spectral optimization

Jonathan Hermon

We present results relating mixing times to the intersection time of branching random walk (BRW) in which the logarithm of the expected number of particles grows at rate of the spe…

math.PR2019

The interchange process on high-dimensional products

Jonathan Hermon, Justin Salez

We resolve a long-standing conjecture of Wilson (2004), reiterated by Oliveira (2016), asserting that the mixing-time of the unit-rate Interchange Process on the -dimensional hy…

math.PR2019

Supercritical percolation on nonamenable graphs: Isoperimetry, analyticity, and exponential decay of the cluster size distribution

Jonathan Hermon, Tom Hutchcroft

Let be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on . We prove that if is nonamenable and then there exists a p…

math.PR2019

Entropy dissipation estimates for inhomogeneous zero-range processes

Jonathan Hermon, Justin Salez

Introduced by Lu and Yau (CMP, 1993), the martingale decomposition method is a powerful recursive strategy that has produced sharp log-Sobolev inequalities for homogeneous particle…