Related papers: Loop cluster on the discrete circle

In this work, which is the first part of a series of two papers, we study the random walk loop soup in dimension two. More specifically, we estimate the probability that two large connected components of loops come close to each other, in…

Let $(X_n)$ be a Markov chain on a standard borelian space $\mathbb{X}$. Any stopping time $\tau$ such that $\mathbb{E}_x\tau$ is finite for all $x\in\mathbb{X}$ induces a Markov chain in $\mathbb{X}$. In this article, we show that there is…

We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors…

A scheme for implementing the discrete-time quantum walk on the Bloch sphere is proposed, which is closely related to the SU(2) group. A spin cluster serves as the walker, whereas its location on the Bloch sphere is described by the spin…

We consider simple random walks on random graphs embedded in $\mathbb{R}^d$ and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we…

The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric problems: we construct the greedy multi-fragment tour for…

This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…

We consider $N\times N$ symmetric random matrices where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove that the eigenvalue spacing statistics in the bulk of the…

We prove that random walks on a family of tilings of d-dimensional Euclidean space, with a canonical choice of conductances, converge to Brownian motion modulo time parameterization. This class of tilings includes Delaunay triangulations…

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Let B_1,B_2, ... be independent one-dimensional Brownian motions defined over the whole real line such that B_i(0)=0. We consider the nth iterated Brownian motion W_n(t)= B_n(B_{n-1}(...(B_2(B_1(t)))...)). Although the sequences of…

There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…

Given a simple transient random walk $(S_n)_{n\geq 0}$ in $\mathbf{Z}$ and a stationary sequence of real random variables $(\xi(s))_{s\in \mathbf{Z}}$, we investigate the extremes of the sequence $(\xi(S_n))_{n\geq 0}$. Under suitable…

In this paper we study a novel spin chain with nearest-neighbors interactions depending on the sites coordinates, which in some sense is intermediate between the Heisenberg chain and the spin chains of Haldane-Shastry type. We show that…

We experimentally demonstrate that the statistical properties of distances between pedestrians which are hindered from avoiding each other are described by the Gaussian Unitary Ensemble of random matrices. The same result has recently been…

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…

Consider a generic triangle in the upper half of the complex plane with one side on the real line. This paper presents a tailored construction of a discrete random walk whose continuum limit is a Brownian motion in the triangle, reflected…

The basic aim of this paper is to study asymptotic properties of the convolution powers K^(n) = K * K * ... * K of a possibly non-symmetric probability density K on a locally compact, compactly generated group G. If K is centered, we show…