36 citations · 196 across the 30 of their papers we have counts for
46 papers
Universality of cutoff for the Exclusion Process
Jonathan Hermon, Gady Kozma, Justin Salez
Under a fairly general condition on the underlying jump rates, we prove that the Exclusion Process with fixed particle density exhibits cutoff at time $t_{mix}\sim \frac{1}{2}{t}_{…
Random walk on the small-world network model in 3 or more dimensions
Zsuzsanna Baran, Jonathan Hermon, Anđela Šarković +2
We study the mixing time of a simple random walk on the small-world network defined by adding edges to as follows: for each pair we add an edge with prob…
Stationary hitting times on vertex-transitive graphs
Nathanaël Berestycki, Jonathan Hermon, Lucas Teyssier
We prove a refined version of the Aldous and Brown's exponential approximation of stationary hitting times. These are valid for all reversible Markov chains. We then specialise our…
Concentration of information on discrete groups
Jonathan Hermon, Xiangying Huang, Francesco Pedrotti +1
Motivated by the Asymptotic Equipartition Property and its recently discovered role in the cutoff phenomenon, we initiate the systematic study of varentropy on discrete groups. Our…
Cutoff for random Cayley graphs of nilpotent groups
Jonathan Hermon, Xiangying Huang
We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes , whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n…
Phase transition for random walks on graphs with added weighted random matching
Zsuzsanna Baran, Jonathan Hermon, Anđela Šarković +1
For a finite graph let be obtained by considering a random perfect matching of and adding the corresponding edges to with weight , while assign…