Related papers: Random walk loop soup
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$…
In this work, we investigate a novel setting of Markovian loop measures and introduce a new class of loop measures called Bosonic loop measures. Namely, we consider loop soups with varying intensity $ \mu\le 0 $ (chemical potential in…
Consider a sequence of Poisson point processes of non-trivial loops with certain intensity measures $(\mu^{(n)})_n$, where each $\mu^{(n)}$ is explicitly determined by transition probabilities $p^{(n)}$ of a random walk on a finite state…
In this paper, we make a few random explorations that relate directly to the items mentioned in the title. We define transient chains and recurrent chains with "killing", the Green's function, the Laplacian operator, and harmonic functions.…
The critical two-dimensional Brownian loop-soup is an infinite collection of non-interacting Brownian loops in a planar domain that possesses some combinatorial features related to the notion of indistinguishability of bosons. The properly…
The aim of this note is to give an alternative construction of interlacements - as introduced by Sznitman - which makes use of classical probabilistic potential theory. In particular, we outline that the intensity measure of an…
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 are interested in path decompositions of a perturbed reflecting Brownian motion (PRBM) at the hitting times and at the minimum. Our study relies on the loop soups developed by Lawler and Werner [10] and Le Jan [13]-[14], in particular on…
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…
The Brownian Web (BW) is a family of coalescing Brownian motions starting from every point in space and time $\R\times\R$. It was first introduced by Arratia, and later analyzed in detail by T\'{o}th and Werner. More recently, Fontes,…
We establish an invariance principle connecting boundary random walks on $\mathbb N$ with Feller's Brownian motions on $[0,\infty)$. A Feller's Brownian motion is a Feller process on $[0,\infty)$ whose excursions away from the boundary $0$…
The loop clusters of a Poissonian ensemble of Markov loops on a finite or countable graph have been studied in \cite{Markovian-loop-clusters-on-graphs}. In the present article, we study the loop clusters associated with a rotation invariant…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…
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…
The fractional Brownian motion is a generalization of ordinary Brownian motion, used particularly when long-range dependence is required. Its explicit introduction is due to B.B. Mandelbrot and J.W. van Ness (1968) as a self-similar…
It is well known (Donsker's Invariance Principle) that the random walk converges to Brownian motion by scaling. In this paper, we will prove that the scaled local time of the $(1,L)-$random walk converges to that of the Brownian motion. The…
Lupu introduced a coupling between a random walk loop-soup and a Gaussian free field, where the sign of the field is constant on each cluster of loops. This coupling is a signed version of isomorphism theorems relating the square of the GFF…
We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\bar{x}$, the procedure converges in polynomial time to…
A celebrated problem in numerical analysis is to consider Brownian motion originating at the centre of a $10 \times 1$ rectangle, and to evaluate the ratio of probabilities of a Brownian path hitting the short ends of the rectangle before…