Jonathan Hermon

12:30 - 1:30 PM: Lunch/Coffee/Tea/Snacks 1:30 - 1:35: Opening Remarks 1:35 - 1:50: Jonathan Hermon A simple characterization of the effective resistance metric on vertex transitive graphs The effective resistance satisfies the triangle inequality and...

The mixing time and spectral gap of a random walk on the symmetric group can sometimes be understood in terms of its low dimensional representations (e.g., Aldous' spectral gap conjecture). It turns out that under a mild degree condition involving...

The mixing time and spectral gap of a random walk on the symmetric group can sometimes be understood in terms of its low dimensional representations (e.g., Aldous' spectral gap conjecture). It turns out that under a mild degree condition involving...

The exclusion process is one of the most basic and best studied processes in the literature on interacting particle systems, with connections to card shuffling and statistical mechanics. It has been one of the major examples driving the study of...

We consider the random Cayley graph of a finite group G formed by picking k random generators uniformly at random: (1) We prove universality of cutoff (for the random walk) and a concentration of measure phenomenon in the Abelian setup (namely, that...

What is the structure of the set of the last few points visited by a random walk on a graph? We show that on vertex-transitive graphs of bounded degree, this set is decorrelated (it is close to a product measure in total variation) if and only if a...