中文
相关论文

相关论文: Lee-Yang zeros and the complexity of the ferromagn…

200 篇论文

We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…

数据结构与算法 · 计算机科学 2018-12-26 Jingcheng Liu , Alistair Sinclair , Piyush Srivastava

The seminal Lee-Yang theorem states that for any graph the zeros of the partition function of the ferromagnetic Ising model lie on the unit circle in $\mathbb C$. In fact the union of the zeros of all graphs is dense on the unit circle. In…

组合数学 · 数学 2022-03-01 Han Peters , Guus Regts

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…

量子物理 · 物理学 2019-07-12 Ryan L. Mann , Michael J. Bremner

We analyze the partition function of the Ising model on graphs of two different types: complete graphs, wherein all nodes are mutually linked and annealed scale-free networks for which the degree distribution decays as $P(k)\sim…

统计力学 · 物理学 2016-03-23 M. Krasnytska , B. Berche , Yu. Holovatch , R. Kenna

We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in terms of the relation between the edge interaction $\beta$ and a parameter $\Delta$ which is an upper bound on the maximum…

计算复杂性 · 计算机科学 2022-04-11 Andreas Galanis , Leslie Ann Goldberg , Andrés Herrera-Poyatos

The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate counting: approximating the partition function of the…

数据结构与算法 · 计算机科学 2021-11-05 Charlie Carlson , Ewan Davies , Alexandra Kolla , Will Perkins

Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core…

离散数学 · 计算机科学 2016-09-14 Andreas Galanis , Daniel Stefankovic , Eric Vigoda

Lee-Yang theory, based on the study of zeros of the partition function, is widely regarded as a powerful and complimentary approach to the study of critical phenomena and forms a foundational part of the theory of phase transitions. Its…

强关联电子 · 物理学 2023-08-02 Jonathan D'Emidio

We study the complexity of computing average quantities related to spin systems, such as the mean magnetization and susceptibility in the ferromagnetic Ising model, and the average dimer count (or average size of a matching) in the…

计算复杂性 · 计算机科学 2013-03-07 Alistair Sinclair , Piyush Srivastava

Lee-Yang zeros are points in the complex plane of an external control parameter at which the partition function vanishes for a many-body system of finite size. In the thermodynamic limit, the Lee-Yang zeros approach the critical value on…

介观与纳米尺度物理 · 物理学 2019-09-06 Aydin Deger , Christian Flindt

The Lee-Yang circle theorem revolutionized our understanding of phase transitions in ferromagnetic systems by showing that the complex zeros of partition functions lie on the unit circle, with criticality arising as these zeros approach the…

无序系统与神经网络 · 物理学 2025-03-14 Chaoming Song

We investigate the location of zeros for the partition function of the anti-ferromagnetic Ising Model, focusing on the zeros lying on the unit circle. We give a precise characterization for the class of rooted Cayley trees, showing that the…

动力系统 · 数学 2021-07-01 Ferenc Bencs , Pjotr Buys , Lorenzo Guerini , Han Peters

We consider the zeros of the partition function of the Ising model with ferromagnetic pair interactions and complex external field. Under the assumption that the graph with strictly positive interactions is connected, we vary the…

数学物理 · 物理学 2023-02-08 Qi Hou , Jianping Jiang , Charles M. Newman

Qualitative and quantitative information about critical phenomena is provided by the distribution of zeros of the partition function in the complex plane. We apply this idea to Ising models on non-periodic systems based on substitution. In…

统计力学 · 物理学 2007-05-23 Harald Simon , Michael Baake , Uwe Grimm

We present a general, rigorous theory of partition function zeros for lattice spin models depending on one complex parameter. First, we formulate a set of natural assumptions which are verified for a large class of spin models in a…

数学物理 · 物理学 2007-05-23 Marek Biskup , Christian Borgs , Jennifer T. Chayes , Logan J. Kleinwaks , Roman Kotecky

Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation…

数据结构与算法 · 计算机科学 2021-08-27 Tyler Helmuth , Holden Lee , Will Perkins , Mohan Ravichandran , Qiang Wu

We present a numerical calculation of the Lee-Yang and Fisher zeros of the 2D Ising model using multi-point Pad\'{e} approximants. We perform simulations for the 2D Ising model with ferromagnetic couplings both in the absence and in the…

高能物理 - 格点 · 物理学 2024-04-16 Simran Singh , Massimo Cipressi , Francesco Di Renzo

Determining the phase diagram of interacting quantum many-body systems is an important task for a wide range of problems such as the understanding and design of quantum materials. For classical equilibrium systems, the Lee-Yang formalism…

统计力学 · 物理学 2022-08-03 Pascal M. Vecsei , Jose L. Lado , Christian Flindt

The analytic structure of the partition function in finite-volume systems is investigated at complex chemical potentials in a minimal mean-field effective model of QCD with finite-size effects incorporated. We discuss the temperature…

高能物理 - 唯象学 · 物理学 2026-05-20 Tatsuya Wada , Győző Kovács , Masakiyo Kitazawa , Takahiro M. Doi

We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…

计算复杂性 · 计算机科学 2013-08-12 Andreas Galanis , Qi Ge , Daniel Stefankovic , Eric Vigoda , Linji Yang
‹ 上一页 1 2 3 10 下一页 ›