Article ID Journal Published Year Pages File Type
9657734 Theoretical Computer Science 2005 30 Pages PDF
Abstract
Using a Markov chain approach and a polyomino-like description, we study some asymptotic properties of monotone increasing runs of uniformly distributed integer random variables. We analyze the limiting trajectories, which after suitable normalization, lead to a Brownian motion, the number of runs, which is asymptotically Gaussian, the run length distribution, the hitting time to a large length k run, which is asymptotically exponential, and the maximum run length which is related to the Gumbel extreme-value distribution function. A preliminary application to DNA analysis is also given.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,