Related papers: Quenched invariance principle for simple random wa…
We study a continuous time random walk X in an environment of dynamic random conductances. We assume that the conductances are stationary ergodic, uniformly bounded and bounded away from zero and polynomially mixing in space and time. We…
We consider a discrete time random walk in a space-time i.i.d. random environment. We use a martingale approach to show that the walk is diffusive in almost every fixed environment. We improve on existing results by proving an invariance…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We show that there exists an ergodic conductance environment such that the weak (annealed) invariance principle holds for the corresponding continuous time random walk but the quenched invariance principle does not hold.
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study random walks on $\mathbb Z^d$ among random conductances $\{C_{xy}\colon x,y\in\mathbb Z^d\}$ that permit jumps of arbitrary length. Apart from joint ergodicity with respect to spatial shifts, we assume only that the…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
We consider a random walk on a homogeneous Poisson point process with energy marks. The jump rates decay exponentially in the A-power of the jump length and depend on the energy marks via a Boltzmann--like factor. The case A=1 corresponds…
We study continuous time random walks on $\mathbb{Z}^d$ (with $d \geq 2$) among random conductances $\{ \omega(\{x,y\}) : x,y \in \mathbb{Z}^d\}$ that permit jumps of arbitrary length. The law of the random variables $\omega(\{x,y\})$,…
We prove the almost sure ('quenched') invariance principle for a random walker on an infinite Bernoulli percolation cluster in $\Z^d$ where $d$ is larger or equal than 2.
Donsker's invariance principle is shown to hold for random walks in rough path topology. As application, we obtain Donsker-type weak limit theorems for stochastic integrals and differential equations.
We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…
We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
Considering a critical branching random walk on the real line. In a recent paper, Aidekon [3] developed a powerful method to obtain the convergence in law of its minimum after a log-factor normalization. By an adaptation of this method, we…
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.