Computable criteria for ballisticity of random walks in elliptic random environment

Abstract

We consider random walks in i.i.d. elliptic random environments which are not uniformly elliptic. We introduce a computable condition in dimension d=2 and a general condition valid for dimensions d 2 expressed in terms of the exit time from a box, which ensure that local trapping would not inhibit a ballistic behavior of the random walk. An important technical innovation related to our computable condition, is the introduction of a geometrical point of view to classify the way in which the random walk can become trapped, either in an edge, a wedge or a square. Furthermore, we prove that the general condition we introduce is sharp.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…