Barma–Dhar critical-bias conjecture for biased random walk on percolation clusters
Barma–Dhar critical-bias conjecture for biased random walk on percolation clusters
Let , where is the critical probability for bond percolation on . For the biased random walk on the infinite percolation cluster, let and be the constants from Theorem 1, so that positive speed holds when and zero speed holds when . Define . Barma–Dhar's critical-bias conjecture. The statements of Theorem 1 hold with . 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
Sign in to submit a solution.
No solutions have been posted yet.