Related papers: Line crossing problem for biased monotonic random …

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…

We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…

We study the biased random walk in positive random conductances on $\mathbb {Z}^d$. This walk is transient in the direction of the bias. Our main result is that the random walk is ballistic if, and only if, the conductances have finite…

We consider a random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice. The walk starts at the origin and is conditioned to hit a remote location y on the lattice. We prove that the expected time under the…

We prove that the drift $\theta(d,\beta)$ for excited random walk in dimension $d$ is monotone in the excitement parameter $\beta \in[0, 1]$, when $d\ge 9$.

Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…

We study a random walk that has a drift $\frac{\beta}{d}$ to the right when located at a previously unvisited vertex and a drift $\frac{\mu}{d}$ to the left otherwise. We prove that in high dimensions, for every $\mu$, the drift to the…

We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…

In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

For biased random walk on the infinite cluster in supercritical i.i.d.\ percolation on $\Z^2$, where the bias of the walk is quantified by a parameter $\beta>1$, it has been conjectured (and partly proved) that there exists a critical value…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

We study a biased random walk on the interlacement set of $\mathbb{Z}^d$ for $d\geq 3$. Although the walk is always transient, we can show, in the case $d=3$, that for any value of the bias the walk has a zero limiting speed and actually…

The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely…

We study biased variable-speed random walks in dynamical random conductances. Assuming that the conductances are upper-bounded, we prove that the walk has strictly positive speed for every bias $\lambda>0$. We then give an explicit…

Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker visited twice or more. This simple model has…

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

We consider the Random Walk Pinning Model studied in [3,2]: this is a random walk X on Z^d, whose law is modified by the exponential of \beta times L_N(X,Y), the collision local time up to time N with the (quenched) trajectory Y of another…