Barma–Dhar critical-bias conjecture for biased random walk on percolation clusters

From papers

Let p(pc,1)p\in(p_c,1), where pc=12p_c=\frac{1}{2} is the critical probability for bond percolation on Z2\mathbb{Z}^2. For the biased random walk on the infinite percolation cluster, let β\beta_\ell and βu\beta_u be the constants from Theorem 1, so that positive speed holds when 1<β<β1<\beta<\beta_\ell and zero speed holds when β>βu\beta>\beta_u. Define βcrit:=β=βu\beta_{\rm crit}:=\beta_\ell=\beta_u. Barma–Dhar's critical-bias conjecture. The statements of Theorem 1 hold with βcrit:=β=βu\beta_{\rm crit}:=\beta_\ell=\beta_u. This conjecture asserts that the transition from positive to zero speed occurs at a single critical bias. The paper proves only the existence of possibly distinct lower and upper thresholds, so equality remains open here.

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

Noam Berger, Nina Gantert and Yuval Peres, “The speed of biased random walk on percolation clusters”, arXiv:math/0211303 (2003).

Solutions 0

No solutions have been posted yet.