Photo from wikipedia
Abstract In this paper we study the random walk on the hypercube (ℤ / 2ℤ) n which at each step flips k randomly chosen coordinates. We prove that the mixing… Click to show full abstract
Abstract In this paper we study the random walk on the hypercube (ℤ / 2ℤ) n which at each step flips k randomly chosen coordinates. We prove that the mixing time for this walk is of the order (n / k)logn. We also prove that if k = o(n) then the walk exhibits cutoff at (n / 2k)logn with window n / 2k.
Keywords:
non local;
walk;
local random;
walk hypercube;
random walk
Journal Title: Advances in Applied Probability
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Advances in Applied Probability
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!