36 citations · 196 across the 30 of their papers we have counts for
9 papers · 1 filter
Infinite and Giant Components in the Layers Percolation Model
Jonathan Hermon
In this work we continue the investigation launched in [FHR16] of the structural properties of the structural properties of the Layers model, a dependent percolation model. Given a…
Rapid Mixing of Hypergraph Independent Set
Jonathan Hermon, Allan Sly, Yumeng Zhang
We prove that the the mixing time of the Glauber dynamics for sampling independent sets on -vertex -uniform hypergraphs is when the maximum degree satisfies…
On sensitivity of mixing times and cutoff
Jonathan Hermon, Yuval Peres
A sequence of chains exhibits (total-variation) cutoff (resp., pre-cutoff) if for all , the ratio tends to 1 as $n…
On an epidemic model on finite graphs
Itai Benjamini, Luiz Renato Fontes, Jonathan Hermon +1
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson() particles per site, with one additional active particle planted at s…
The social network model on infinite graphs
Jonathan Hermon, Ben Morris, Chuan Qin +1
Given an infinite connected regular graph , place at each vertex Pois() walkers performing independent lazy simple random walks on simultaneously. When two walkers…
Frogs on trees?
Jonathan Hermon
We study a system of simple random walks on , the -ary tree of depth , known as the frog model. Initially there are…