English
Related papers

Related papers: Two-sided random walks conditioned to have no inte…

200 papers

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…

Probability · Mathematics 2025-12-24 Eszter Couillard

In this paper we continue our study of a multidimensional random walk with zero mean and finite variance killed on leaving a cone. We suggest a new approach that allows one to construct a positive harmonic function in Lipschitz cones under…

Probability · Mathematics 2021-12-21 Denis Denisov , Vitali Wachtel

We consider one-dependent random walks on $\mathbb{Z}^d$ in random hypergeometric environment for $d\ge 3$. These are memory-one walks in a large class of environments parameterized by positive weights on directed edges and on pairs of…

Probability · Mathematics 2020-08-10 Tal Orenshtein , Christophe Sabot

We prove a quenched invariance principle for a class of random walks in random environment on $\mathbb{Z}^d$, where the walker alters its own environment. The environment consists of an outgoing edge from each vertex. The walker updates the…

Probability · Mathematics 2021-07-02 Swee Hong Chan , Lila Greco , Lionel Levine , Peter Li

Let $\{A, B, C\}$ be a partition of a sample space $\Omega$. For a random walk $S_n = x + \sum_{j=1}^n X_j$ starting at $x \in A$, we find estimates for the Green's function $G_{A \cup B}(x,y)$ and the hitting time $E^x(T_C)$ for $x, y \in…

Probability · Mathematics 2014-05-16 Michael Carlisle

We present a procedure that determines the law of a random walk in an iid random environment as a function of a single "typical" trajectory. We indicate when the trajectory characterizes the law of the environment, and we say how this law…

Probability · Mathematics 2007-05-23 Omer Adelman , Nathanaël Enriquez

We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…

Probability · Mathematics 2020-01-28 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta , Neeraja Sahasrabudhe

We consider two interacting random walks on $\mathbb{Z}$ such that the transition probability of one walk in one direction decreases exponentially with the number of transitions of the other walk in that direction. The joint process may…

Probability · Mathematics 2023-03-09 Fernando P. A. Prado , Cristian F. Coletti , Rafael A. Rosales

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

Probability · Mathematics 2018-08-07 Kohei Uchiyama

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…

Probability · Mathematics 2015-03-05 Ross G. Pinsky , Nicholas F. Travers

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

Combinatorics · Mathematics 2026-01-23 Ziemowit Kostana , Jarosław Swaczyna , Agnieszka Widz

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

Dynamical Systems · Mathematics 2015-08-17 Péter Pál Varjú

We study variable-speed random walks on $\mathbb Z$ driven by a family of nearest-neighbor time-dependent random conductances $\{a_t(x,x+1)\colon x\in\mathbb Z, t\ge0\}$ whose law is assumed invariant and ergodic under space-time shifts. We…

Probability · Mathematics 2020-01-06 Marek Biskup

Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…

Probability · Mathematics 2014-09-29 Nadine Guillotin-Plantard , Julien Poisat

A pair of random walks $(R,S)$ on the vertices of a graph $G$ is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along $R$ and $S$ without colliding. We consider questions related to P. Winkler's…

Combinatorics · Mathematics 2025-06-30 Aaron Abrams , Henry Landau , Zeph Landau , James Pommersheim , Eric Zaslow

We derive a quenched invariance principle for random walks in random environments whose transition probabilities are defined in terms of weighted cycles of bounded length. To this end, we adapt the proof for random walks among random…

Probability · Mathematics 2008-12-18 Jean-Dominique Deuschel , Holger Kösters

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

Probability · Mathematics 2015-08-18 Andrea Collevecchio , Kais Hamza , Meng Shi

A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary…

Probability · Mathematics 2026-05-05 Aleksandr Mysliuk

In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median,…

Statistical Mechanics · Physics 2019-10-28 Jason Cantarella , Kyle Chapman , Philipp Reiter , Clayton Shonkwiler

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

Probability · Mathematics 2022-03-14 Laurent Saloff-Coste , Yuwen Wang