ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N≥1N\ge 1, let P\mathcal{P} be a nearest-neighbor path in Zd\mathbb{Z}^d connecting 00 to ∂B1(0,N)\partial B_1(0,N), and write ∣P∣|\mathcal{P}| for its length. Let {Xn}n=0∞\{X_n\}_{n=0}^\infty be a dd-dimensional simple random walk starting at 00.

Sharp covering-decay conjecture. There are an ϵ>0\epsilon>0 and a P^d∈(0,1)\hat P_d\in(0,1) such that, for every d≥4d\ge4 and every such path satisfying ∣P∣≤N1+ϵ|\mathcal{P}|\le N^{1+\epsilon},

P(Trace(P)⊆Trace({Xn}n=0∞))≤P^dN1+ϵ.P\left({\rm Trace}(\mathcal{P})\subseteq {\rm Trace}\big(\{X_n\}_{n=0}^\infty\big)\right)\le \hat P_d^{N^{1+\epsilon}}.

This would improve the theorem's upper bound for paths of length N1+ϵN^{1+\epsilon} and yield nontrivial bounds for the chemical distance within a three-dimensional random-walk trace. The conjecture is presented as open; the paper notes that its proposed reflection argument cannot prove it.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.