Bounded-probe conjecture for the probing simple random walk
Consider a probing simple random walk (PSRW) on growing domains in , , starting at with . At time , it sends an -adapted number of probes, each adding one site to the domain before the walk moves. In the setting of part (b) of Proposition general_soldier, each probe location is chosen according to the hitting measure of for simple random walk started at . Bounded-probe conjecture. There exist an -adapted process , uniformly bounded above by a non-random integer , and a PSRW with an almost surely transient sample path when , and an almost surely recurrent sample path with when . If this conjecture is valid, it remains to determine whether it holds with and whether the same conclusion holds for constant , eliminating all control from the PSRW.
References
Primary source
Amir Dembo, Ruojun Huang and Vladas Sidoravicius, “Monotone interaction of walk and graph: recurrence versus transience”, arXiv:1406.3764 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.