相关论文: The speed of biased random walks among dynamical r…

For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…

We consider a weighted lattice $Z^d$ with conductance $\mu_e=|e|^{-\alpha}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using an intrinsic metric. We also show that when $d=2$…

Consider a closed surface $M$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $M$ with finite first moment. Corresponding to each point in the Teichm\"uller space of $M$, there is an…

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…

We consider random walk among iid, uniformly elliptic conductances on $\mathbb Z^d$, and prove the Einstein relation (see Theorem 1). It says that the derivative of the velocity of a biased walk as a function of the bias equals the…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…

We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…

Consider the first exit time of one-dimensional Brownian motion $\{B_s\}_{s\geq 0}$ from a random passageway. We discuss a Brownian motion with two time-dependent random boundaries in quenched sense. Let $\{W_s\}_{s\geq 0}$ be an other…

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…

We consider the telegraph process with two velocities, $a_1>a_2\in\mathbb{R}$, and two rates of reversal, $\lambda_1,\lambda_2>0$. We study some of its features with respect to the conditional probability measure where both the initial…

Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

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…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…

We consider a self-attracting random walk in dimension d=1, in presence of a field of strength s, which biases the walker toward a target site. We focus on the dynamic case (true reinforced random walk), where memory effects are implemented…

We prove that every random walk in a uniformly elliptic random environment satisfying the cone mixing condition and a non-effective polynomial ballisticity condition with high enough degree has an asymptotic direction.