Related papers: Loop cluster on the discrete circle
This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) is…
Let $\{\eta_i\}_{i\ge 1}$ be a sequence of dependent Bernoulli random variables. While the Poisson approximation for the distribution of $\sum_{i=1}^n\eta_i$ has been extensively studied in the literature, this paper establishes new…
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…
We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling…
The Poisson and Martin boundaries for invariant random walks on the dual of the orthogonal quantum groups A_o(F), are identified with higher dimensional Podles spheres that we describe in terms of generators and relations. This provides the…
We prove that the empirical law of eigenvalues of Brownian motion on the Lie Group $\mathrm{GL}(N,\mathbb{C})$ converges almost surely to a deterministic probability measure, characterized by a free stochastic differential equation. This…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
The Novikov-Shubin invariant associated to a graph provides information about the accumulation of eigenvalues of the corresponding adjacency matrix close to the origin. For a directed graph these eigenvalues lie in the complex plane and…
We show that along a density one subsequence of admissible radii, the nearest neighbor spacing between lattice points on circles is Poissonian.
We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence…
We reduce the computation of Poisson traces on quotients of symplectic vector spaces by finite subgroups of symplectic automorphisms to a finite one, by proving several results which bound the degrees of such traces as well as the dimension…
For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…
We study spin systems defined by the winding of a random walk loop soup. For a particular choice of loop soup intensity, we show that the corresponding spin system is reflection-positive and is dual, in the Kramers-Wannier sense, to the…
In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
We study the evolution of a collection of individuals subject to Brownian diffusion, reproduction and disappearance. In particular, we focus on the case where the individuals are initially prepared at equilibrium within a confined geometry.…
We study products of random isometries acting on Euclidean space. Building on previous work of the second author, we prove a local limit theorem for balls of shrinking radius with exponential speed under the assumption that a Markov…
We define and study a set of operators that compute statistical properties of the Brownian Loop Soup, a conformally invariant gas of random Brownian loops (Brownian paths constrained to begin and end at the same point) in two dimensions. We…
We study how the problem of observables is fully resolved for background independent theories defined on finite graphs. We argue the correct analogue of coordinate independence is the invariance under changes of graph labels, a kind of…
We consider a large class of random geometric graphs constructed from samples $\mathcal{X}_n = \{X_1,X_2,\ldots,X_n\}$ of independent, identically distributed observations of an underlying probability measure $\nu$ on a bounded domain…