Related papers: Connection probabilities in the double-dimer model…
The behaviour of fermions in the background of a double-step potential is analyzed with a general mixing of scalar and vector couplings via continuous chiral-conjugation transformation. Provided the vector coupling does not exceed the…
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…
We consider the dimer model on piecewise Temperleyan, simply connected domains, on families of graphs which include the square lattice as well as superposition graphs. We focus on the spanning tree $\mathcal{T}_\delta$ associated to this…
It is found that the exact beta-function $\beta(g)$ of the continuous 2D $g\Phi^{4}$ model possesses two types of dual symmetries, these being the Kramers-Wannier (KW) duality symmetry and the weak-strong-coupling symmetry $f(g)$, or…
We consider the double-dimer model in the upper-half plane discretized by the square lattice with mesh size $\delta$. For each point $x$ in the upper half-plane, we consider the random variable $N_\delta(x)$ given by the number of the…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
We completely describe by inequalities the set of boundary correlation matrices of planar Ising networks embedded in a disk. Specifically, we build on a recent result of M.~Lis to give a simple bijection between such correlation matrices…
From conformal field theory on the Riemann sphere, we implement its boundary version in a simply-connected domain using the Schottky double construction. We consider the statistical fields generated by background charge modification of the…
We study a generalisation of the double-dimer model that encompasses several models of interest, including the monomer double-dimer model, spatial random permutations, the dimer model, and the spin $O(N)$ model, and which is also related to…
The six-vertex model with domain wall boundary conditions (DWBC) on an N x N square lattice is considered. The two-point correlation function describing the probability of having two vertices in a given state at opposite (top and bottom)…
In analogy with the well-known 2-linkage tractor-trailer problem, we define a 2-linkage problem in the plane with novel non-holonomic ``no-slip'' conditions. Using constructs from sub-Riemannian geometry, we look for geodesics corresponding…
In his seminal paper published in 2000 Kenyon developed a method to study the height function of the planar dimer model via discrete complex analysis tools. The core of this method is a set of identities representing height correlations…
Recent numerical and analytical work has shown that for the square-lattice Heisenberg model the boundary can induce Dimer correlations near the edge which are absent in spin-wave theories and non-linear sigma model approaches. Here, we…
We propose a random matrix model as a representation for $D=1$ open strings. We show that the model is equivalent to $N$ fermions with spin in a central potential that also includes a long-range ferromagnetic interaction between the…
We consider nested CLE$_4$ in a simply-connected domain and compute the following renormalised probabilities: the probability that two points belong to the same CLE$_4$ gasket and the probability that two points belong to the outermost…
We consider a non-integrable model for interacting dimers on the two-dimensional square lattice. Configurations are perfect matchings of $\mathbb Z^2$, i.e. subsets of edges such that each vertex is covered exactly once ("close-packing"…
We study the large-scale behavior of the height function in the dimer model on the square lattice. Richard Kenyon has shown that the fluctuations of the height function on Temperleyan discretizations of a planar domain converge in the…
We identify the asymptotic probability of a configuration model $\mathrm{CM}_n(\boldsymbol{d})$ to produce a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well…
Given an edge weighted graph and a forest $F$, the $\textit{2-edge connectivity augmentation problem}$ is to pick a minimum weighted set of edges, $E'$, such that every connected component of $E'\cup F$ is 2-edge connected. Williamson et…
Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review…