Related papers: A switching identity for cable-graph loop soups an…
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 Gaussian free field on two-dimensional slabs with a thickness described by a height $h$ at spatial scale $N$. We investigate the radius of critical clusters for the associated cable-graph percolation problem, which depends…
In this paper, we address the formal characterization of targets triggering cellular trans-differentiation in the scope of Boolean networks with asynchronous dynamics. Given two fixed points of a Boolean network, we are interested in all…
We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…
For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…
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 show that an information-theoretic relation called the de Bruijn-type identity can be reformulated in a physical context with probability currents. The time derivatives of relative entropies under the continuity equation are presented,…
We study properties of occupation times by Brownian excursions and Brownian loops in two-dimensional domains. This allows for instance to interpret some Gaussian fields, such as the Gaussian Free Fields as (properly normalized) fluctuations…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…
For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…
We consider the random field defined by the layering numbers of the Brownian loop soup in a bounded simply connected domain in the complex plane. We call this the layering field and show that, after a suitable renormalization, it converges…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions…
The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar development yields a…
We consider continuous-time random interlacements on a transient weighted graph. We prove an identity in law relating the field of occupation times of random interlacements at level u to the Gaussian free field on the weighted graph. This…
This is the second of two papers devoted to the proof of conformal invariance of the critical double random current on the square lattice. More precisely, we show convergence of loop ensembles obtained by taking the cluster boundaries in…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
For massless vertex-transitive transient graphs, the percolation phase transition for the level sets of the Gaussian free field on the associated continuous cable system is particularly well understood, and in particular the associated…
We prove sharpness of the phase transition for the random-cluster model with $q \geq 1$ on graphs of the form $\mathcal{S} := \mathcal{G} \times S$, where $\mathcal{G}$ is a planar lattice with mild symmetry assumptions, and $S$ a finite…
In this article, we construct samples of SLE-like curves out of samples of CLE and Poisson point process of Brownian excursions. We show that the law of these curves depends continuously on the intensity measure of the Brownian excursions.…