Bounded-probe conjecture for the probing simple random walk

From papers

Consider a probing simple random walk (PSRW) {Kt}\{K_t\} on growing domains {Dt}\{\mathbb{D}_t\} in Zd\mathbb{Z}^d, d2d\ge2, starting at K0=0K_0=0 with D0={0}\mathbb{D}_0=\{0\}. At time tt, it sends an Ft\mathcal{F}_t-adapted number m(t)m(t) 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 Dtc\mathbb{D}_t^c for simple random walk started at KtK_t. Bounded-probe conjecture. There exist an Ft\mathcal{F}_t-adapted process m(t)m(t), uniformly bounded above by a non-random integer λd\lambda_d, and a PSRW with an almost surely transient sample path when d3d\ge3, and an almost surely recurrent sample path with m(t)1m(t)\ge1 when d=2d=2. If this conjecture is valid, it remains to determine whether it holds with λd=1\lambda_d=1 and whether the same conclusion holds for constant m(t)=λdm(t)=\lambda_d, eliminating all control from the PSRW.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Amir Dembo, Ruojun Huang and Vladas Sidoravicius, “Monotone interaction of walk and graph: recurrence versus transience”, arXiv:1406.3764 (2014).

Solutions 0

No solutions have been posted yet.