Related papers: Multidimensional random walk with reflections

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…

We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…

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 study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…

Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discrete time step, the walker resamples the label at its current…

In this paper we study the number of returns to the coordinate hyperplanes for multidimensional nearest-neighbour random walks. While one-dimensional results on returns are classical, much less is known in higher dimensions. We analyse the…

We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

For normally reflected Brownian motion and for simple random walk on independently growing in time d-dimensional domains, d>=3, we establish a sharp criterion for recurrence versus transience in terms of the growth rate.

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 introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…

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…

In this note we prove a large deviation result for the intersection of the ranges of two independent random walks in dimension two. This complements the study of Phetpradap from 2011, where the intersection in dimension three and above was…

We tackle the problem of reflectance estimation from a set of multi-view images, assuming known geometry. The approach we put forward turns the input images into reflectance maps, through a robust variational method. The variational model…

We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…