Related papers: External diffusion limited aggregation on a spanni…
We study a variant of the Generalized Excited Random Walk (GERW) on $\mathbb{Z}^d$ introduced by Menshikov, Popov, Ram\'irez and Vachkovskaia in [Ann. Probab. 40 (5), 2012]. It consists of a particular version of the model studied in [arXiv…
In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
Levy walk (LW) process has been used as a simple model for describing anomalous diffusion in which the mean squared displacement of the walker grows non-linearly with time in contrast to the diffusive motion described by simple random walks…
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…
Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…
In this paper, we study second order fluctuations for the size of the range of a critical branching random walk (BRW) in $\mathbb Z^d$. We consider the BRW with geometric offspring indexed by the Kesten tree, and show that the size of its…
We consider one-dimensional discrete-time random walks (RWs) with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the case of L\'evy flights. We study the expected maximum ${\mathbb E}[M_n]$ of bridge RWs, i.e.,…
The recently introduced hierarchical regular networks HN3 and HN4 are analyzed in detail. We use renormalization group arguments to show that HN3, a 3-regular planar graph, has a diameter growing as \sqrt{N} with the system size, and random…
We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
A mated-CRT map is a random planar map obtained as a discretized mating of correlated continuum random trees. Mated-CRT maps provide a coarse-grained approximation of many other natural random planar map models (e.g., uniform triangulations…
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a…
The Random Walk Metropolis (RWM) algorithm is a Metropolis- Hastings MCMC algorithm designed to sample from a given target distribution \pi with Lebesgue density on R^N. RWM constructs a Markov chain by randomly proposing a new position…
In the present note we analyze the one-dimensional multi-particle diffusion limited aggregation (MDLA) model: the initial number of particles at each positive integer site has Poisson distribution with mean $\mu$, independently of all other…
We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…
Several models based on the diffusion-limited aggregation (DLA) model were proposed and their scaling properties explored by computational and theoretical approaches. In this paper, we consider a new extension of the on-lattice DLA model in…
We study a system of coalescing random walks on the integer lattice $\mathbb{Z}^{d}$ in which the walk is oriented in the $d$-th direction and follows certain specified rules. We first study the geometry of the paths and show that, almost…
We consider Erd\H{o}s-R\'enyi graphs $G(n,p)$ for $0 < p < 1$ fixed and $n \rightarrow \infty$ and study the expected number of steps, $H_{wv}$, that a random walk started in $w$ needs to first arrive in $v$. A natural guess is that an…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…