Related papers: Ising model and s-embeddings of planar graphs
We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic…
Mathematical modeling of epidemic propagation on networks is extended to hypergraphs in order to account for both the community structure and the nonlinear dependence of the infection pressure on the number of infected neighbours. The exact…
We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…
We study totally umbilic isometric immersions between Riemannian manifolds. First, we provide a novel characterization of the totally umbilic isometric immersions with parallel normalized mean curvature vector, i.e., those having nonzero…
Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…
The isometric embedding problem for Riemannian manifolds, which connects intrinsic and extrinsic geometry, is a central question in differential geometry with deep theoretical significance and wide-ranging applications. Despite extensive…
Partition functions are an important research object in combinatorics and mathematical physics [Barvinok, 2016]. In this work, we consider the partition function of the Ising antiferromagnet on random regular graphs and characterize its…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
Learning distributed representations for nodes in graphs is a crucial primitive in network analysis with a wide spectrum of applications. Linear graph embedding methods learn such representations by optimizing the likelihood of both…
The triangle covering number of a graph is the minimum number of vertices that hit all triangles. Given positive integers $s,t$ and an $n$-vertex graph $G$ with $\lfloor n^2/4 \rfloor +t$ edges and triangle covering number $s$, we determine…
The finite size scaling behaviour for the Ising model in five dimensions, with either free or cyclic boundary, has been the subject for a long running debate. The older papers have been based on ideas from e.g. field theory or…
We review the recent construction \cite{brower2024isingmodelmathbbs2} of the 2d Ising model on a triangulated sphere $\mathbb{S}^2$. Surprisingly, this led to a precise map of the lattice couplings to the target geometry in order to reach…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop…
We explore the connection between the transfer matrix formalism and discrete complex analysis approach to the two dimensional Ising model. We construct a discrete analytic continuation matrix, analyze its spectrum and establish a direct…
For an oriented isometric immersion $f:M\to S^n$ the spherical Gauss map is the Legendrian immersion of its unit normal bundle $UM^\perp$ into the unit sphere subbundle of $TS^n$, and the geodesic Gauss map $\gamma$ projects this into the…
We establish new characterizations of amenability of graphs through two probabilistic notions: stochastic domination and finitary codings (also called finitary factors). On the stochastic domination side, we show that the plus state of the…
We show that the critical Kac-Ward operator on isoradial graphs acts in a certain sense as the operator of s-holomorphicity, and we identify the fermionic observable for the spin Ising model as the inverse of this operator. This result is…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
We study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand model unifying two closely related models: the subgraph world…