Related papers: A coupling between random walks in random environm…
A physical-mathematical approach to anomalous diffusion may be based on fractional diffusion equations and related random walk models. The fundamental solutions of these equations can be interpreted as probability densities evolving in time…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
We study a new class of time inhomogeneous P\'olya-type urn schemes and give optimal rates of convergence for the distribution of the properly scaled number of balls of a given color to nearly the full class of generalized gamma…
We briefly review the random matrix theory for large N by N matrices viewed as free random variables in a context of stochastic diffusion. We establish a surprising link between the spectral properties of matrix-valued multiplicative…
We present precise moderate deviation probabilities, in both quenched and annealed settings, for a recurrent diffusion process with a Brownian potential. Our method relies on fine tools in stochastic calculus, including Kotani's lemma and…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
We consider a model of random walk in ${\mathbb Z}^2$ with (fixed or random) orientation of the horizontal lines (layers) and with non constant iid probability to stay on these lines. We prove the transience of the walk for any fixed…
We study the spectral theory of a reversible Markov chain associated to a hypoelliptic random walk on a manifold M. This random walk depends on a parameter h which is roughly the size of each step of the walk. We prove uniform bounds with…
This paper explores the mixing time of the random transposition walk on the symmetric group. While it has long been known that this walk mixes in order n*log(n) time, this result has not previously been attained using coupling. A coupling…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
Levy walks define a fundamental concept in random walk theory which allows one to model diffusive spreading that is faster than Brownian motion. They have many applications across different disciplines. However, so far the derivation of a…
Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…
Motivated by its relevance for the study of perturbations of one-dimensional voter models, including stochastic Potts models at low temperature, we consider diffusively rescaled coalescing random walks with branching and killing. Our main…
Background: This study is mainly motivated by the need of understanding how the diffusion behaviour of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell,…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We prove that, after suitable rescaling, the simple random walk on the trace of a large critical branching random walk converges to the Brownian motion on the integrated super-Brownian excursion.
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.