Bounded-probe conjecture for the probing simple random walk
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.