{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T06:27:50Z","timestamp":1667024870837},"reference-count":22,"publisher":"Institute of Mathematical Statistics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Appl. Probab."],"published-print":{"date-parts":[[2017,4,1]]},"DOI":"10.1214\/16-aap1183","type":"journal-article","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T02:06:19Z","timestamp":1495764379000},"source":"Crossref","is-referenced-by-count":1,"title":["Reconstruction of a multidimensional scenery with a branching random walk"],"prefix":"10.1214","volume":"27","author":[{"given":"Heinrich","family":"Matzinger","sequence":"first","affiliation":[]},{"given":"Angelica","family":"Pachon","sequence":"additional","affiliation":[]},{"given":"Serguei","family":"Popov","sequence":"additional","affiliation":[]}],"member":"108","reference":[{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Kalikow, S. A. (1982). $T,\\,T^{-1}$ transformation is not loosely Bernoulli. <i>Ann. of Math.<\/i> (2) <b>115<\/b> 393\u2013409.","DOI":"10.2307\/1971397"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Kesten, H. (1996). Detecting a single defect in a scenery by observing the scenery along a random walk path. In <i>It\u00f4\u2019s Stochastic Calculus and Probability Theory<\/i> 171\u2013183. Springer, Tokyo.","DOI":"10.1007\/978-4-431-68532-6_11"},{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Benjamini, I. and Kesten, H. (1996). Distinguishing sceneries by observing the scenery along a random walk path. <i>J. Anal. Math.<\/i> <b>69<\/b> 97\u2013135.","DOI":"10.1007\/BF02787104"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] den Hollander, F. and Steif, J. E. (1997). Mixing properties of the generalized $T,T^{-1}$-process. <i>J. Anal. Math.<\/i> <b>72<\/b> 165\u2013202.","DOI":"10.1007\/BF02843158"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Howard, C. D. (1996). Detecting defects in periodic scenery by random walks on $\\mathbf{Z}$. <i>Random Structures Algorithms<\/i> <b>8<\/b> 59\u201374.","DOI":"10.1002\/(SICI)1098-2418(199601)8:1<59::AID-RSA3>3.0.CO;2-Q"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Howard, C. D. (1996). Orthogonality of measures induced by random walks with scenery. <i>Combin. Probab. Comput.<\/i> <b>5<\/b> 247\u2013256.","DOI":"10.1017\/S0963548300002017"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Howard, C. D. (1997). Distinguishing certain random sceneries on $\\textbf{Z}$ via random walks. <i>Statist. Probab. Lett.<\/i> <b>34<\/b> 123\u2013132.","DOI":"10.1016\/S0167-7152(96)00173-3"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Kesten, H. (1998). Distinguishing and reconstructing sceneries from observations along random walk paths. In <i>Microsurveys in Discrete Probability<\/i> (<i>Princeton<\/i>, <i>NJ<\/i>, 1997). <i>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.<\/i> <b>41<\/b> 75\u201383. Amer. Math. Soc., Providence, RI.","DOI":"10.1090\/dimacs\/041\/05"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Lember, J. and Matzinger, H. (2008). Information recovery from a randomly mixed up message-text. <i>Electron. J. Probab.<\/i> <b>13<\/b> 396\u2013466.","DOI":"10.1214\/EJP.v13-491"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Lindenstrauss, E. (1999). Indistinguishable sceneries. <i>Random Structures Algorithms<\/i> <b>14<\/b> 71\u201386.","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] L\u00f6we, M., Matzinger, H. and Merkl, F. (2004). Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps. <i>Electron. J. Probab.<\/i> <b>9<\/b> 436\u2013507 (electronic).","DOI":"10.1214\/EJP.v9-206"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] L\u00f6we, M. and Matzinger, H. III (2002). Scenery reconstruction in two dimensions with many colors. <i>Ann. Appl. Probab.<\/i> <b>12<\/b> 1322\u20131347.","DOI":"10.1214\/aoap\/1037125865"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Matzinger, H. (1999). Reconstructing a three-color scenery by observing it along a simple random walk path. <i>Random Structures Algorithms<\/i> <b>15<\/b> 196\u2013207.","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<196::AID-RSA5>3.0.CO;2-#"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Matzinger, H. (2005). Reconstructing a two-color scenery by observing it along a simple random walk path. <i>Ann. Appl. Probab.<\/i> <b>15<\/b> 778\u2013819.","DOI":"10.1214\/105051604000000972"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] Matzinger, H. and Pachon, A. (2011). DNA approach to scenery reconstruction. <i>Stochastic Process. Appl.<\/i> <b>121<\/b> 2455\u20132473.","DOI":"10.1016\/j.spa.2011.04.010"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Matzinger, H. and Popov, S. (2007). Detecting a local perturbation in a continuous scenery. <i>Electron. J. Probab.<\/i> <b>12<\/b> 637\u2013660.","DOI":"10.1214\/EJP.v12-409"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Matzinger, H. and Rolles, S. W. W. (2003). Reconstructing a random scenery observed with random errors along a random walk path. <i>Probab. Theory Related Fields<\/i> <b>125<\/b> 539\u2013577.","DOI":"10.1007\/s00440-003-0257-3"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] Matzinger, H. and Rolles, S. W. W. (2003). Reconstructing a piece of scenery with polynomially many observations. <i>Stochastic Process. Appl.<\/i> <b>107<\/b> 289\u2013300.","DOI":"10.1016\/S0304-4149(03)00085-1"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Matzinger, H. and Rolles, S. W. W. (2006). Finding blocks and other patterns in a random coloring of $\\mathbb{Z}$. <i>Random Structures Algorithms<\/i> <b>28<\/b> 37\u201375.","DOI":"10.1002\/rsa.20110"},{"key":"20","unstructured":"[20] Ornstein, D. (1971). A Kolmogorov automorphism that is not a Bernoulli shift. <i>Matematika<\/i> <b>15<\/b> 131\u2013150. (In Russian.)"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Popov, S. and Pachon, A. (2011). Scenery reconstruction with branching random walk. <i>Stochastics<\/i> <b>83<\/b> 107\u2013116.","DOI":"10.1080\/17442508.2010.544973"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] Weiss, B. (1972). The isomorphism problem in ergodic theory. <i>Bull. Amer. Math. Soc.<\/i> <b>78<\/b> 668\u2013684.","DOI":"10.1090\/S0002-9904-1972-12979-3"}],"container-title":["The Annals of Applied Probability"],"original-title":[],"link":[{"URL":"http:\/\/projecteuclid.org\/download\/pdfview_1\/euclid.aoap\/1495764363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T16:25:27Z","timestamp":1620404727000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/annals-of-applied-probability\/volume-27\/issue-2\/Reconstruction-of-a-multidimensional-scenery-with-a-branching-random-walk\/10.1214\/16-AAP1183.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,1]]},"references-count":22,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,4,1]]}},"URL":"https:\/\/doi.org\/10.1214\/16-aap1183","relation":{},"ISSN":["1050-5164"],"issn-type":[{"value":"1050-5164","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4,1]]}}}