J. Hermon

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 2021Show all

5 papers · 1 filter

math.PR2021★ 2 cited

A direct comparison between the mixing time of the interchange process with "few" particles and independent random walks

Jonathan Hermon, Richard Pymar

We consider the interchange process with $k$ particles ( $IP (k)$ ) on $n$ -vertex hypergraphs in which each hyperedge $e$ rings at rate $r_{e}$ . When $e$ rings, the particles occu…

math.PR2021★ 9 cited

Mean Field Behavior during the Big Bang Regime for Coalescing Random Walks

Jonathan Hermon, Shuangping Li, Dong Yao +1

In this paper we consider coalescing random walks on a general connected graph $G = (V, E)$ . We set up a unified framework to study the leading order of the decay rate of $P_{t}$ , the e…

math.PR2021

Covering a graph with independent walks

Jonathan Hermon, Perla Sousi

Let $P$ be an irreducible and reversible transition matrix on a finite state space $V$ with invariant distribution $π$ . We let $k$ chains start by choosing independent locations di…

math.PR2021★ 8 cited

Cutoff for Almost All Random Walks on Abelian Groups

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 ≪ lo g k ≪ lo g ∣ G ∣$ ; denote it $G_{k}$ . A conjecture of…

math.PR2021★ 4 cited

Geometry of Random Cayley Graphs of Abelian Groups

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite Abelian group $G$ with respect to $k$ generators chosen uniformly at random, with $1 ≪ lo g k ≪ lo g ∣ G ∣$ . Draw a vertex $U \sim \o…