相关论文: Line crossing problem for biased monotonic random …

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…

We consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…

This elementary treatment first summarizes extreme values of a Bernoulli random walk on the one-dimensional integer lattice over a finite discrete time interval. Both the symmetric (unbiased) and asymmetric (biased) cases are discussed.…

Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…

The greedy walk is a deterministic walk that always moves from its current position to the nearest not yet visited point. In this paper we consider the greedy walk on an inhomogeneous Poisson point process on the real line. Our primary…

We consider a continuous-time branching random walk in the inhomogeneous breeding potential $\beta|.|^p$, where $\beta > 0$, $p \geq 0$. We prove that the population almost surely explodes in finite time if $p > 1$ and doesn't explode if $p…

We study a random walk on a point process given by an ordered array of points $(\omega_k, \, k \in \mathbb{Z})$ on the real line. The distances $\omega_{k+1} - \omega_k$ are i.i.d. random variables in the domain of attraction of a…

We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c. For b<b_c,…

We investigate excited random walks on $\Z^d, d\ge 1,$ and on planar strips $\Z\times\{0,1,...,L-1\}$ which have a drift in a given direction. The strength of the drift may depend on a random i.i.d. environment and on the local time of the…

The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent…

We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…

In this article, a localisation result is proved for the biased random walk on the range of a simple random walk in high dimensions (d \geq 5). This demonstrates that, unlike in the supercritical percolation setting, a slowdown effect…

Let $X_1, X_2, \ldots$ be i.i.d. random variables with values in $\mathbb{Z}^d$ satisfying $\mathbb{P} \left(X_1=x\right) = \mathbb{P} \left(X_1=-x\right) = \Theta \left(\|x\|^{-s}\right)$ for some $s>d$. We show that the random walk…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…

For a multivariate random walk with i.i.d. jumps satisfying the Cramer moment condition and having a mean vector with at least one negative component, we derive the exact asymptotics of the probability of ever hitting the positive orthant…

We consider a random walk X_n in Z_+, starting at X_0=x>= 0, with transition probabilities P(X_{n+1}=X_n+1|X_n=y>=1)=1/2-\delta/(4y+2\delta) P(X_{n+1}=X_n+1|X_n=y>=1)=1/2+\delta/(4y+2\delta) and X_{n+1}=1 whenever X_n=0. We prove that the…

We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…