Related papers: Approximating the monomer-dimer constants through …
We consider the overdamped dynamics of a paradigmatic long-range system of particles residing on the sites of a one-dimensional lattice, in the presence of thermal noise. The internal degree of freedom of each particle is a periodic…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
Lattice models are valuable tools to gain insight into the statistical physics of heteropolymers. We rigorously map the partition function of these models into a vacuum expectation value of a $\mathbb{Z}_2$ lattice gauge theory (LGT), with…
In this paper, we study entire solutions of the difference equation $\psi(z+h)=M(z)\psi(z)$, $z\in{\mathbb C}$, $\psi(z)\in {\mathbb C}^2$. In this equation, $h$ is a fixed positive parameter and $M: {\mathbb C}\to SL(2,{\mathbb C})$ is a…
Three-dimensional Ising model in zero external field is exactly solved by operator algebras, similar to the Onsager's approach in two dimensions. The partition function of the simple cubic crystal imposed by the periodic boundary condition…
This paper is concerned with the analysis of elastic wave scattering of a time-harmonic plane wave by a biperiodic rigid surface, where the wave propagation is governed by the three-dimensional Navier equation. An exact transparent boundary…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…
We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
We consider the permanent of a square matrix with non-negative entries. A tractable approximation is given by the so-called Bethe permanent that can be efficiently computed by running the sum-product algorithm on a suitable factor graph.…
The aim of this paper is studying the problem of almost periodicity of almost periodic lattice dynamical systems of the form $u_{i}'=\nu (u_{i-1}-2u_i+u_{i+1})-\lambda u_{i}+F(u_i)+f_{i}(t)\ (i\in \mathbb Z,\ \lambda >0)$. We prove the…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
We obtain an asymptotic formula, as $n\to\infty$, for the monomer-monomer correlation function $K_2(x,y)$ in the classical dimer model on a triangular lattice, with the horizontal and vertical weights $w_h=w_v=1$ and the diagonal weight…
Efficient estimation of high-dimensional matrices-including covariance and precision matrices-is a cornerstone of modern multivariate statistics. Most existing studies have focused primarily on the theoretical properties of the estimators…
In this paper we propose an algorithm for exact partitioning of high-order models. We define a general class of $m$-degree Homogeneous Polynomial Models, which subsumes several examples motivated from prior literature. Exact partitioning…
We consider the monomer-dimer model on weighted graphs embedded in surfaces with boundary, with the restriction that only monomers located on the boundary are allowed. We give a Pfaffian formula for the corresponding partition function,…
This paper proposes a simple strategy to simulate stochastic differential equations (SDE) arising in constant temperature molecular dynamics. The main idea is to patch an explicit integrator with Metropolis accept or reject steps. The…
We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…