Related papers: Long-range one-dimensional internal diffusion-limi…
We propose a new model of cluster growth according to which the probability that a new unit is placed in a point at a distance $r$ from the city center is a Gaussian with mean equal to the cluster radius and variance proportional to the…
We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…
Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…
The asymptotic results that underlie applications of extreme random fields often assume that the variables are located on a regular discrete grid, identified with $\mathbb{Z}^2$, and that they satisfy stationarity and isotropy conditions.…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
Graph clustering is an important technique to understand the relationships between the vertices in a big graph. In this paper, we propose a novel random-walk-based graph clustering method. The proposed method restricts the reach of the…
We introduce a persistent random walk model with finite velocity and self-reinforcing directionality, which explains how exponentially distributed runs self-organize into truncated L\'evy walks observed in active intracellular transport by…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
We consider a branching random walk on $\mathbb{Z}$ started by $n$ particles at the origin, where each particle disperses according to a mean-zero random walk with bounded support and reproduces with mean number of offspring $1+\theta/n$.…
In close analogy to diffusion limited aggregation (DLA) and inspired by a work of Roux, a random walker algorithm is constructed to solve the problem of crack growth in an elastic medium. In contrast to conventional lattice approaches, the…
We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…
We consider the maximum $M_t$ of branching random walk in a space-inhomogeneous random environment on $\mathbb{Z}$. In this model the branching rate while at some location $x\in\mathbb{Z}$ is randomized in an i.i.d. manner. We prove that…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
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…
We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the…
We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…