9 citations · 42 across the 19 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DM2021★ 8 cited
Balanced Allocations: Caching and Packing, Twinning and Thinning
Dimitrios Los, Thomas Sauerwald, John Sylvester
We consider the sequential allocation of balls (jobs) into bins (servers) by allowing each ball to choose from some bins sampled uniformly at random. The goal is to maintai…
math.CO2021
Tangled Paths: A Random Graph Model from Mallows Permutations
Jessica Enright, Kitty Meeks, William Pettersson +1
We introduce the random graph which results from taking the union of two paths of length , where the vertices of one of the paths have been relabelled a…
math.PR2021★ 2 cited
The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
John Sylvester
The cover time of a Markov chain on a finite state space is the expected time until all states are visited. We show that if the cover time of a discrete-time Markov chain with rati…