Related papers: Random walks in dynamic random environments: A tra…
Modeling of polymer chains has received a lot of attention in mathematics. In fact, probabilistic models that naturally arise in statistical mechanics have been widely studied by mathematicians for the very challenging and novel problems…
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…
This paper is concerned with ergodic properties of inhomogeneous Markov processes. Since the transition probabilities depend on initial times, the existing methods to obtain invariant measures for homogeneous Markov processes are not…
We show that random walk in uniformly elliptic i.i.d. environment in dimension $\geq5$ has at most one non zero limiting velocity. In particular this proves a law of large numbers in the distributionally symmetric case and establishes…
We consider continuous-time random walks on a random locally finite subset of $\mathbb{R}^d$ with random symmetric jump probability rates. The jump range can be unbounded. We assume some second--moment conditions and that the above…
The use of higher-order stochastic processes such as nonlinear Markov chains or vertex-reinforced random walks is significantly growing in recent years as they are much better at modeling high dimensional data and nonlinear dynamics in…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
We introduce a diffusion model for energetically inhomogeneous systems. A random walker moves on a spin-S Ising configuration, which generates the energy landscape on the lattice through the nearest-neighbors interaction. The underlying…
We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central…
We provide a probabilistic analysis of the banker algorithm when transition probabilities may depend on time and space. The transition probabilities evolve, as time goes by, along the trajectory of an ergodic Markovian environment, whereas…
Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…
We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…
This paper studies particle propagation in a one-dimensional inhomogeneous medium where the laws of motion are generated by chaotic and deterministic local maps. Assuming that the particle's initial location is random and uniformly…
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…
In this paper, we study a subclass of piecewise-deterministic Markov processes with a Polish state space, involving deterministic motion punctuated by random jumps that occur at exponentially distributed time intervals. Over each of these…
Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…
We consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under…
Charge transport processes in disordered complex media are accompanied by anomalously slow relaxation for which usually a broad distribution of relaxation times is adopted. To account for those properties of the environment, a standard…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices.…