Related papers: Loop cluster on the discrete circle

We study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are…

Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk…

The main topic of these notes are Markov loops, studied in the context of continuous time Markov chains on discrete state spaces. We refer to [1] and [2] for the short "history" of the subject. In contrast with these references, symmetry is…

For random collections of self-avoiding loops in two-dimensional domains, we define a simple and natural conformal restriction property that is conjecturally satisfied by the scaling limits of interfaces in models from statistical physics.…

The two-dimensional Brownian loop-soup is a Poissonian random collection of loops in a planar domain with an intensity parameter c. When c is not greater than 1, we show that the outer boundaries of the loop clusters are disjoint simple…

We study the structure of Brownian loop-soup clusters in two dimensions. Among other things, we obtain the following decomposition of the clusters with critical intensity: When one conditions a loop-soup cluster by its outer boundary…

We study Brownian loop soup clusters in $\mathbb{R}^3$ for an arbitrary intensity $\alpha>0$. We show the existence of a phase transition for the presence of unbounded clusters and study its basic properties. In particular, we show that,…

We consider the loop soup at intensity ${1\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned…

The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…

The random walk loop soup is a Poissonian ensemble of lattice loops; it has been extensively studied because of its connections to the discrete Gaussian free field, but was originally introduced by Lawler and Trujillo Ferreras as a discrete…

We conduct cluster analysis on a class of locally asymptotically self-similar stochastic processes, which includes multifractional Brownian motion as a representative. When the true number of clusters is supposed to be known, a new…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

We study a limit behavior of a sequence of Markov processes (or Markov chains) such that their distributions outside of any neighborhood of a "singular" point attract to some probability law. In any neighborhood of this point the behavior…

The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…

We show that if one conditions a cluster in a Brownian loop-soup $L$ (of any intensity) in a two-dimensional domain by a portion $l$ of its outer boundary, then in the remaining domain, the union of all the loops of $L$ that touch $l$…

We investigate random partitions of complete graphs defined by Poissonian emsembles of Markov loops

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

We consider random walks on locally compact groups, extending the geometric criteria for the identification of their Poisson boundary previously known for discrete groups. First, we prove a version of the Shannon-McMillan-Breiman theorem,…

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

In this research announcement, we show that SLE curves can in fact be viewed as boundaries of certain simple Poissonian percolation clusters: Recall that the Brownian loop-soup (introduced in the paper arxiv:math.PR/0304419 with Greg…