Related papers: Quenched invariance principle for simple random wa…
Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective…
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…
The Skorokhod Embedding problem is well understood when the underlying process is a Brownian motion. We examine the problem when the underlying is the simple symmetric random walk and when no external randomisation is allowed. We prove that…
In this work, we characterize cluster-invariant point processes for critical branching spatial processes on R d for all large enough d when the motion law is $\alpha$-stable or has a finite discrete range. More precisely, when the motion is…
For percolating systems, we propose a universal exponent relation connecting the leading corrections to scaling of the cluster size distribution with the dynamic corrections to the asymptotic transport behaviour at criticality. Our…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
The branching rule is one of the most fundamental properties of the Macdonald symmetric polynomials. It expresses a Macdonald polynomial as a nonnegative linear combination of Macdonald polynomials with smaller number of variables. Taking a…
We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…
We provide a classification of translation invariant one-dimensional quantum walks with respect to continuous deformations preserving unitarity, locality, translation invariance, a gap condition, and some symmetry of the tenfold way. The…
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on $\mathbb{Z}^2$ is $\mathrm{SLE}_2$. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into…
We study the quenched invariance principle for random conductance models with long range jumps on $\Z^d$, where the transition probability from $x$ to $y$ is, on average, comparable to $|x-y|^{-(d+\alpha)}$ with $\alpha\in (0,2)$ but is…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
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…
Coherent transport of excitations along chains of coupled quantum systems represents an interesting problem with a number of applications ranging from quantum optics to solar cell technology. A convenient tool for studying such processes…
We study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…
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 consider a stationary and ergodic random field {\omega(b)} parameterized by the family of bonds b in Z^d, d>1. The random variable \omega(b) is thought of as the conductance of bond b and it ranges in a finite interval [0,c_0]. Assuming…
The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…
We derive diffusion constants and martingales for senile random walks with the help of a time-change. We provide direct computations of the diffusion constants for the time-changed walks. Alternatively, the values of these constants can be…
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…