Related papers: Universal fluctuations in the support of the rando…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
A random walk is performed on a disordered landscape composed of $N$ sites randomly and uniformly distributed inside a $d$-dimensional hypercube. The walker hops from one site to another with probability proportional to $\exp [- \beta…
We study simple random walk on the uniform spanning tree on Z^2 . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean…
Despite a long history and a clear overall understanding of properties of random walks on an incipient infinite cluster in percolation, some important information on it seems to be missing in the literature. In the present work, we revisit…
Several stochastic processes modeling molecular motors on a linear track are given by random walks (not necessarily Markovian) on quasi 1d lattices and share a common regenerative structure. Analyzing this abstract common structure, we…
Human mobility is a fundamental process underpinning socioeconomic life and urban structure. Classic theories, such as egocentric activity spaces and central place theory, provide crucial insights into specific facets of movement, like…
Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…
Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…
We consider random walks in Dirichlet environment (RWDE) on $\Z ^d$, for $ d \geq 3 $, in the sub-ballistic case. We associate to any parameter $ (\alpha_1, ..., \alpha_{2d}) $ of the Dirichlet law a time-change to accelerate the walk. We…
We consider random walks on finite vertex-transitive graphs $\Gamma$ of bounded degree. We find a simple geometric condition which characterises the cover time fluctuations: the suitably normalised cover time converges to a standard Gumbel…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
The interaction of all mobile species with their environment hinges on their movement patterns: the places they visit and how frequently they go there. In human society, where the prevalent form of cohabitation is in cities, the highly…
We study the mean number of encounters up to time t, E_N(t), taking place in a subspace with dimension d* of a d-dimensional lattice, for N independent random walkers starting simultaneously from the same origin. E_N is first evaluated…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…
Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…
In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…
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 [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…
Inspired by the recent viral epidemic outbreak and its consequent worldwide pandemic, we devise a model to capture the dynamics and the universality of the spread of such infectious diseases. The transition from a pre-critical to the…
A classical random walker starting on a node of a finite graph will always reach any other node since the search is ergodic, namely it is fully exploring space, hence the arrival probability is unity. For quantum walks, destructive…