相关论文: From loop clusters and random interlacement to the…

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…

We introduce and study a Markov field on the edges of a graph in dimension $d\geq2$ whose configurations are spin networks. The field arises naturally as the edge-occupation field of a Poissonian model (a soup) of non-backtracking loops and…

Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of cycles. We study its connectivity pattern, which is a…

We investigate level-set percolation of the Gaussian free field on transient trees, for instance on super-critical Galton-Watson trees conditioned on non-extinction. Recently developed Dynkin-type isomorphism theorems provide a comparison…

We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…

We study the percolative properties of random interlacements on the product of G with the integer line Z, when G is a weighted graph satisfying certain sub-Gaussian estimates attached to the parameters alpha > 1, measuring the volume growth…

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 consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

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…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

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…

We make a few elementary observations that relate directly the items mentioned in the title. In particular, we note that when one superimposes the random current model related to the Ising model with an independent Bernoulli percolation…

We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…

Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…

In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…

The vacant set of random interlacements on ${\mathbb{Z}}^d$, $d\ge3$, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039--2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831--858]…

We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…

We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…