most citedImproved bounds for the mixing time of the random-to-random insertion shuffle

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.PR2016

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…

math.PR2014★ 1 cited

Improved bounds for the mixing time of the random-to-random insertion shuffle

Ben Morris, Chuan Qin

We prove an upper bound of for the mixing time of the random-to-random insertion shuffle, improving on the best known upper bound of . Our proof is ba…