首页 | 本学科首页   官方微博 | 高级检索  
     


Finding blocks and other patterns in a random coloring of ℤ
Authors:Heinrich Matzinger  Silke W.W. Rolles
Abstract:Let ξ = (ξk)k∈? be i.i.d. with Pk = 0) = Pk = 1) = 1/2, and let S: = (Sk)urn:x-wiley:10429832:media:RSA20110:tex2gif-inf-6 be a symmetric random walk with holding on ?, independent of ξ. We consider the scenery ξ observed along the random walk path S, namely, the process (χk := ξurn:x-wiley:10429832:media:RSA20110:tex2gif-inf-9)urn:x-wiley:10429832:media:RSA20110:tex2gif-inf-11. With high probability, we reconstruct the color and the length of blockn, a block in ξ of length ≥ n close to the origin, given only the observations (χk)urn:x-wiley:10429832:media:RSA20110:tex2gif-inf-14. We find stopping times that stop the random walker with high probability at particular places of the scenery, namely on blockn and in the interval [?3n,3n]. Moreover, we reconstruct with high probability a piece of ξ of length of the order 3urn:x-wiley:10429832:media:RSA20110:tex2gif-sup-6 around blockn, given only 3urn:x-wiley:10429832:media:RSA20110:tex2gif-sup-9 observations collected by the random walker starting on the boundary of blockn. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006
Keywords:random walk  random media  scenery reconstruction  polynomial algorithm
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号