相关论文: A switching identity for cable-graph loop soups an…
Duality transformation, which relates a high-temperature phase to a low-temperature one, is used exactly to determine the critical point for several models (2D Ising, Potts, Ashkin-Teller, 8-vertex), as the self dual condition. By changing…
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…
This article deals with limit theorems for certain loop variables for loop soups whose intensity approaches infinity. We first consider random walk loop soups on finite graphs and obtain a central limit theorem when the loop variable is the…
In communication networks, the binding numbers of graphs (or networks) are often used to measure the vulnerability and robustness of graphs (or networks). Furthermore, the fractional factors of graphs and the fractional…
We present three new identities in law for quadratic functionals of conditioned bivariate Gaussian processes. In particular, our results provide a two-parameter generalization of a celebrated identity in law, involving the path variance of…
In this paper, we establish the existence and equivalence of four types of incipient infinite clusters (IICs) for the critical Gaussian free field (GFF) level-set and the critical loop soup on the metric graph $\widetilde{\mathbb{Z}}^d$ for…
We introduce a natural "massive" version of the Brownian loop soup of Lawler and Werner which displays conformal covariance and exponential decay. We show that this massive Brownian loop soup arises as the near-critical scaling limit of a…
For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…
Consider a Brownian loop soup $\mathcal{L}_D^\theta$ with subcritical intensity $\theta \in (0,1/2]$ in some 2D bounded simply connected domain. We define and study the properties of a conformally invariant field $h_\theta$ naturally…
A network of chaotic systems can be designed in such a way that the cluster patterns formed by synchronous nodes can be controlled through the coupling parameters. We present a novel approach to exploit such a network for covert…
We define and study a set of operators that compute statistical properties of the Brownian Loop Soup, a conformally invariant gas of random Brownian loops (Brownian paths constrained to begin and end at the same point) in two dimensions. We…
We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…
For a Brownian loop soup with intensity $c\in(0,1]$ in the unit disk, we show that almost surely, the set of simple (resp. double) points on any portion of boundary of any of its clusters has Hausdorff dimension $2-\xi_c(2)$ (resp.…
A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We prove the…
Some exact identities connecting the one- and two-particle Green's functions in the presence of spin-orbit coupling have been derived. These identities is similar to the usual Ward identity in the particle or charge transport theory and a…
The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…
Many signals evolve in time as a stochastic process, randomly switching between states over discretely sampled time points. Here we make an explicit link between the underlying stochastic process of a signal that can take on a bounded…
We study spin systems defined by the winding of a random walk loop soup. For a particular choice of loop soup intensity, we show that the corresponding spin system is reflection-positive and is dual, in the Kramers-Wannier sense, to the…
`Double edge swaps' transform one graph into another while preserving the graph's degree sequence, and have thus been used in a number of popular Markov chain Monte Carlo (MCMC) sampling techniques. However, while double edge-swaps can…
In this paper, we discuss the entanglement properties of graph-diagonal states, with particular emphasis on calculating the threshold for the transition between the presence and absence of entanglement (i.e. the separability point). Special…