Richard Pymar

activity

20132021

most citedA permuted random walk exits faster

4 citations · 8 across the 3 of their papers we have counts for

collaborators

Showing math.PRShow all

4 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.PR2018

The exclusion process mixes (almost) faster than independent particles

Jonathan Hermon, Richard Pymar

Oliveira conjectured that the order of the mixing time of the exclusion process with $k$ -particles on an arbitrary $n$ -vertex graph is at most that of the mixing-time of $k$ indepe…

math.PR2013★ 4 cited

A permuted random walk exits faster

Richard Pymar, Perla Sousi

Let $σ$ be a permutation of ${0, \dots, n}$ . We consider the Markov chain $X$ which jumps from $k \neq = 0, n$ to $σ (k + 1)$ or $σ (k - 1)$ , equally likely. When $X$ is at 0 it jumps to ei…

math.PR2013★ 2 cited

Partial mixing of semi-random transposition shuffles

Richard Pymar

We show that for any semi-random transposition shuffle on $n$ cards, the mixing time of any given $k$ cards is at most $n lo g k$ , provided $k = o ((n / lo g n)^{1/2})$ . In the case of t…