Stochastic Flips on Two-letter Words

Details Stochastic Flips on Two-letter Words Stochastic Flips on Two-letter Words

2010-10-06

arxiv.org/abs/1010.1086v1

Mathematics

Probability

ANALCO'10

Scientific paper

This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing \emph{flips}, a local transformation which exchanges two consecutive different letters. More precisely, only the flips which do not increase the number of pairs of consecutive identical letters are allowed. Fixed-points of such a process thus perfectly alternate different letters. We show that the expected number of flips to converge towards a fixed-point is bounded by $O(n^3)$ in the worst-case and by $O(n^{5/2}\ln{n})$ in the average-case, where $n$ denotes the length of the initial word.

Affiliated with

Also associated with

No associations

Rating

Stochastic Flips on Two-letter Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic Flips on Two-letter Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic Flips on Two-letter Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427357