The Klee-Minty random edge chain moves with linear speed
classification
🧮 math.PR
math.CO
keywords
speedlinearmovesrightbitsboundschainconfiguration
read the original abstract
An infinite sequence of 0's and 1's evolves by flipping each~1 to a~0 exponentially at rate one. When a~1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1's to the left of the origin, we show that the leftmost~1 moves right with linear speed. Upper and lower bounds are given on the speed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.