Related papers: Degeneracy Algorithm for Random Magnets
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…
By building upon the recent theory that established the connection between implicit generative modeling (IGM) and optimal transport, in this study, we propose a novel parameter-free algorithm for learning the underlying distributions of…
Along the way initiated by Carleo and Troyer [1], we construct the neural-network quantum state of transverse-field Ising model(TFIM) by an unsupervised machine learning method. Such a wave function is a map from the spin-configuration…
Transport in undoped graphene is related to percolating current patterns in the networks of {\em N-} and {\em P}-type regions reflecting the strong bipolar charge density fluctuations. Transmissions of the {\em P-N} junctions, though small,…
In many frustrated Ising models, a single-spin flip dynamics is frozen out at low temperatures compared to the dominant interaction energy scale because of the discrete "multiple valley" structure of degenerate ground-state manifold. This…
As perhaps the most studied paradigm for a quantum phase transition, the periodic quantum Ising chain is exactly solvable via the Jordan-Wigner transformation followed by a Fourier transform that diagonalizes the model in the momentum space…
In this thesis, we present fast deterministic algorithm to find small cuts in distributed networks. Finding small min-cuts for a network is essential for ensuring the quality of service and reliability. Throughout this thesis, we use the…
We compute the exact partition function of the 2D Ising Model at critical temperature but with nonzero magnetic field at the boundary. The model describes a renormalization group flow between the free and fixed conformal boundary conditions…
We consider the numerical approximation of a continuum model of antiferromagnetic and ferrimagnetic materials. The state of the material is described in terms of two unit-length vector fields, which can be interpreted as the magnetizations…
We consider the classical Minimum Balanced Cut problem: given a graph $G$, compute a partition of its vertices into two subsets of roughly equal volume, while minimizing the number of edges connecting the subsets. We present the first {\em…
We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an…
We explore entanglement loss along renormalization group trajectories as a basic quantum information property underlying their irreversibility. This analysis is carried out for the quantum Ising chain as a transverse magnetic field is…
While widely acknowledged as highly effective in computer vision, multi-label MRFs with non-convex priors are difficult to optimize. To tackle this, we introduce an algorithm that iteratively approximates the original energy with an…
The topological degeneracy of ground states in transverse field Ising chain cannot be removed by local perturbation and allows it to be a promising candidate for topological computation. We study the dynamic processes of crystallization and…
Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…
The effect of the zero centered Gaussian random magnetic field distribution on the phase diagrams and ground state magnetizations of the transverse Ising thin film has been investigated. As a formulation, the differential operator technique…
The standard Metropolis algorithm and the parallel tempering method are used to examine magnetization processes in the Ising model with the long-range RKKY interaction on the Shastry-Sutherland lattice. It is shown that the Ising model with…
In this work we consider algorithms for reconstructing time-varying data into a finite sum of discrete trajectories, alternatively, an off-the-grid sparse-spikes decomposition which is continuous in time. Recent work showed that this…
In this paper we study the inference of the kinetic Ising model on sparse graphs by the decimation method. The decimation method, which was first proposed in [Phys. Rev. Lett. 112, 070603] for the static inverse Ising problem, tries to…
We present numerical simulations for the diluted antiferromagnetic 3D Ising model (DAFF) in an external magnetic field at zero temperature. Our results are compatible with the DAFF being in the same universality class as the Random Field…