55 citations · 134 across the 13 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.PR2016
Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
Sarah Cannon, David Levin, Alexandre Stauffer
We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall…
cs.DC2016★ 28 cited
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
Sarah Cannon, Joshua J. Daymude, Dana Randall +1
In systems of programmable matter, we are given a collection of simple computation elements (or particles) with limited (constant-size) memory. We are interested in when they can s…