Related papers: A switching identity for cable-graph loop soups an…
In this note, we show the following feature of the relation between Brownian loop-soups on cable-graphs and their total occupation time-field $\Lambda$: When conditioned on $\Lambda$, the conditional law of individual loops becomes singular…
We derive an intensity doubling feature of critical Brownian loop-soups on the cable-graphs of ${\mathbb Z}^d$ for $d \ge 7$ that can be described as follows: In the box $[-N, N]^d$ (and with a probability that goes to $1$ as $N$ goes to…
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 on the metric graphs two types of scalar Gaussian free fields (GFF), the usual one and the one twisted by a $\{-1,1\}$-valued gauge field. We show that the latter can be obtained, up to an additional deterministic transformation,…
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…
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$…
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…
We investigate level sets of the Gaussian free field on continuous transient metric graphs $\tilde{\mathcal G}$ and study the capacity of its level set clusters. We prove, without any further assumption on the base graph $\mathcal{G}$, that…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
The level lines of the Gaussian free field are known to be related to SLE(4). It is shown how this relation allows to define chordal SLE(4) processes on doubly connected domains, describing traces that are anchored on one of the two…
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…
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.…
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 address the problem of predicting the labeling of a graph in an online setting when the labeling is changing over time. We present an algorithm based on a specialist approach; we develop the machinery of cluster specialists which…
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…
We study vertex-like operators built from the Brownian loop soup in the limit as the loop soup intensity tends to infinity. More precisely, following Camia, Gandolfi and Kleban (Nuclear Physics B 902, 2016), we take a Brownian loop soup in…
Given a Bayesian network structure (directed acyclic graph), the celebrated d-separation algorithm efficiently determines whether the network structure implies a given conditional independence relation. We show that this changes drastically…
We prove that for the Gaussian free field (GFF) on the metric graph of $\mathbb{Z}^d$ (for all $d\ge 3$ except the critical dimension $d_c=6$), with uniformly positive probability there exist two distinct sign clusters of diameter at least…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We study the clusters of loops in a Brownian loop soup in some bounded two-dimensional domain with subcritical intensity $\theta \in (0,1/2]$. We obtain an exact expression for the asymptotic probability of the existence of a cluster…