Related papers: Excursion Set Theory for Correlated Random Walks
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
Analytical results for the distribution of first hitting times of random walks on Erd\H{o}s-R\'enyi networks are presented. Starting from a random initial node, a random walker hops between adjacent nodes until it hits a node which it has…
In this paper we present an integro-differential diffusion equation for continuous time random walk that is valid for a generic waiting time probability density function. Using this equation we also study diffusion behaviors for a couple of…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
In this paper we present analytical and random walk based solutions to diffusion in semi-permeable layered media with varying diffusivity. We propose a new random walk transit model (hybrid model) based on treating the membrane permeability…
We propose a picture of the fluctuations in branching random walks, which leads to predictions for the distribution of a random variable that characterizes the position of the bulk of the particles. We also interpret the $1/\sqrt{t}$…
Min et al. (2009) presented two complementary techniques that use the diffusion approximation to allow efficient Monte-Carlo radiation transfer in very optically thick regions: a modified random walk and a partial diffusion approximation.…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
We study random walks on $\mathbb{Z}$ which have a linear (or almost linear) drift towards 0 in a range around 0. This drift leads to a metastable Gaussian distribution centered at zero. We give specific, fast growing, time windows where we…
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
We consider a discrete-time random walk on a line starting at $x_0\geq 0$ where a cost is incurred at each jump. We obtain an exact analytical formula for the distribution of the total cost of a trajectory until the process crosses the…
We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
We present the first sublinear-in-$n$ round algorithm for sampling an approximately uniform spanning tree of an $n$-vertex graph in the CongestedClique model of distributed computing. In particular, our algorithm requires…
We consider conservative cross-diffusion systems for two species where individual motion rates depend linearly on the local density of the other species. We develop duality estimates and obtain stability and approximation results. We first…
Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools…
Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which are common in…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…