A shift-refresh chain cyclically moves a pointer through the coordinates of a bit vector and replaces the visited bit by an independent fair bit. Once the pointer walk has visited every residue, all coordinates have been refreshed, giving a strong stationary time.

Ancestors (9)

  1. Cutoff for Markov chains
  2. Mixing time of a Markov chain
  3. Markov chain
  4. Markov process
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version