66 citations · 129 across the 23 of their papers we have counts for
5 papers · 2 filters
Mixing time bounds via bottleneck sequences
Louigi Addario-Berry, Matthew I. Roberts
We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bo…
Exceptional times of the critical dynamical Erdős-Rényi graph
Matthew I. Roberts, Bati Sengul
In this paper we introduce a network model which evolves in time, and study its largest connected component. We consider a process of graphs , where initially we…
The probability of unusually large components in the near-critical Erdős-Rényi graph
Matthew I. Roberts
The largest components of the critical Erdős-Rényi graph, with , have size of order with high probability. We give detailed asymptotics for the probabilit…
One-point localization for branching random walk in Pareto environment
Marcel Ortgiese, Matthew I. Roberts
We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show a very strong form of intermittency, where wit…
Scaling limit and ageing for branching random walk in Pareto environment
Marcel Ortgiese, Matthew I. Roberts
We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show that the system of particles, rescaled in an a…