Related papers: The Ising Partition Function: Zeros and Determinis…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…
Despite there being significant work on developing spectral, and metric embedding based approximation algorithms for hypergraph generalizations of conductance, little is known regarding the approximability of hypergraph partitioning…
We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising…
We investigate the distribution of zeros of the partition function of the two- and three-dimensional symmetric $\pm J$ Ising spin glasses on the complex field plane. We use the method to analytically implement the idea of numerical transfer…
The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an…
In this paper, we present a novel approach to approximate the gain function of the feedback particle filter (FPF). The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian. The numerical…
This work presents an algorithmic scheme for solving the infinite-time constrained linear quadratic regulation problem. We employ an accelerated version of a popular proximal gradient scheme, commonly known as the Forward-Backward Splitting…
In this thesis, we present results on phase transition for two models: the semi-infinite Ising model with a decaying field, and the long-range Ising model with a random field. We study the semi-infinite Ising model with an external field…
This paper presents the results of an experimental study of graph partitioning. We describe a new heuristic technique, path optimization, and its application to two variations of graph partitioning: the max_cut problem and the…
We develop a fully microscopic, statistical mechanics approach to study phase transitions in Ising systems with competing interactions at different scales. Our aim is to consider orientational and positional order parameters in a unified…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
This paper introduces a technique to enhance the efficiency of quadratic machine learning models, particularly Field-Aware Factorization Machines (FFMs) handling binary data. Our approach strategically reduces model size through optimized…
We investigate the application of graph-cut methods for the study of the critical behaviour of the two-dimensional random-field Ising model. We focus on exact ground-state calculations, crossing the phase boundary of the model at zero…
Computing the partition function, $Z$, of an Ising model over a graph of $N$ \enquote{spins} is most likely exponential in $N$. Efficient variational methods, such as Belief Propagation (BP) and Tree Re-Weighted (TRW) algorithms, compute…
The density of states for the three-dimensional Ising model is calculated with high-precision from multicanonical simulations. This allows us to estimate the leading partition function zeros for lattice sizes up to L=32. Combining previous…
The inability of conventional electronic architectures to efficiently solve large combinatorial problems motivates the development of novel computational hardware. There has been much effort recently toward developing novel,…
We review some aspects of the fermionic interpretation of the two-dimensional Ising model. The use is made of the notion of the integral over the anticommuting Grassmann variables. For simple and more complicated 2D Ising lattices, the…
The goal of this paper is to exhibit a deep relation between the partition function of the Ising model on a planar trivalent graph and the generating series of the spin network evaluations on the same graph. We provide respectively a…