English
Related papers

Related papers: Complex Langevin boundary terms in lattice models

200 papers

A general introduction into the subject aimed at a general theoretical physics audience. We introduce the sign problem posed by finite density lattice QCD, and we discuss the main methods proposed to circumvent it, with emphasis on the…

High Energy Physics - Lattice · Physics 2008-11-26 M. P. Lombardo

Some recent developments to handle the numerical sign problem in QCD and related theories at nonzero density are reviewed. In this contribution I focus on changing the integration order to soften the severity of the sign problem, the…

High Energy Physics - Lattice · Physics 2015-02-13 Gert Aarts

Developments in QCD at finite density are reviewed. I begin by discussing some new algorithms which have been applied to other theories with sign problems. Then I discuss the method of analytic continuation in QCD using a series expansion…

High Energy Physics - Lattice · Physics 2011-01-04 Sourendu Gupta

The three-dimensional SU(3) spin model is an effective Polyakov loop model for QCD at nonzero temperature and density. It suffers from a sign problem at nonzero chemical potential. We revisit this model using complex Langevin dynamics and…

High Energy Physics - Lattice · Physics 2015-06-03 Gert Aarts , Frank A. James

Lattice QCD at non-vanishing chemical potential is studied using the complex Langevin equation (CLE). One of the conditions for the correctness of the results of the CLE is that the zeroes of the measure coming from the fermionic…

High Energy Physics - Lattice · Physics 2016-11-10 G. Aarts , E. Seiler , D. Sexty , I. -O. Stamatescu

It is well known that investigating QCD at finite density by standard Monte Carlo methods is extremely difficult due to the sign problem. Some years ago, the complex Langevin method with gauge cooling was shown to work at high temperature,…

High Energy Physics - Lattice · Physics 2019-01-15 Keitaro Nagata , Jun Nishimura , Shinji Shimasaki

The Laplace approximation is a popular method for constructing a Gaussian approximation to the Bayesian posterior and thereby approximating the posterior mean and variance. But approximation quality is a concern. One might consider using…

Statistics Theory · Mathematics 2025-06-17 Mikołaj J. Kasprzak , Ryan Giordano , Tamara Broderick

We present new results of full QCD at nonzero chemical potential. In PRD 92, 094516 (2015) the complex Langevin method was shown to break down when the inverse coupling decreases and enters the transition region from the deconfined to the…

High Energy Physics - Lattice · Physics 2018-04-18 Jacques Bloch , Olaf Schenk

In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we…

Formal Languages and Automata Theory · Computer Science 2021-02-02 Nathanaël Fijalkow , Guillaume Lagarde

We use chiral perturbation theory to investigate twisted and partially twisted boundary conditions which allow access to momenta other than integer multiples of 2pi/L on a lattice with spatial volume L^3. For K -> pi pi decays we show that…

High Energy Physics - Lattice · Physics 2009-10-09 Jonathan Flynn , Andreas Juttner , Christopher Sachrajda , Giovanni Villadoro

I argue that regularizing terms in standard regression methods not only help against overfitting finite data, but sometimes also yield better causal models in the infinite sample regime. I first consider a multi-dimensional variable…

Machine Learning · Statistics 2019-07-01 Dominik Janzing

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…

Information Theory · Computer Science 2007-07-13 Igal Sason , Shlomo Shamai

The increasing deployment of machine learning as well as legal regulations such as EU's GDPR cause a need for user-friendly explanations of decisions proposed by machine learning models. Counterfactual explanations are considered as one of…

Machine Learning · Computer Science 2020-08-04 André Artelt , Barbara Hammer

The great majority of algorithms employed in the study of lattice field theory are based on Monte Carlo's importance sampling method, i.e. on probability interpretation of the Boltzmann weight. Unfortunately in many theories of interest one…

High Energy Physics - Lattice · Physics 2016-06-03 Lorenzo Bongiovanni

The correct use and interpretation of models depends on several steps, two of which being the calibration by parameter estimation and the analysis of uncertainty. In the biological literature, these steps are seldom discussed together, but…

Quantitative Methods · Quantitative Biology 2015-08-17 André Chalom , Paulo Inácio de Knegt López de Prado

This is a pedagogical review of the lattice study of finite density QCD, which is intended to provide the minimum necessary contents, so that the paper may be used as the first reading for a newcomer to the field and also for those working…

High Energy Physics - Lattice · Physics 2009-11-10 Shin Muroya , Atsushi Nakamura , Chiho Nonaka , Tetsuya Takaishi

The sign problem at nonzero chemical potential prohibits the use of importance sampling in lattice simulations. Since complex Langevin dynamics does not rely on importance sampling, it provides a potential solution. Recently it was shown…

High Energy Physics - Lattice · Physics 2015-06-12 Gert Aarts , Frank A. James , Jan M. Pawlowski , Erhard Seiler , Denes Sexty , Ion-Olimpiu Stamatescu

In recent years there has been much progress on the investigation of the QCD phase diagram with lattice QCD simulations. In this review I focus on the developments in the last two years. Especially the addition of external influences or new…

High Energy Physics - Lattice · Physics 2021-02-17 Jana N. Guenther

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

Logic in Computer Science · Computer Science 2023-02-14 Shenghua Feng , Mingshuai Chen , Han Su , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Naijun Zhan

In materials science, wedge disclinations are defects caused by angular mismatches in the crystallographic lattice. To describe such disclinations, we introduce an atomistic model in planar domains. This model is given by a…

Analysis of PDEs · Mathematics 2020-05-28 Pierluigi Cesana , Patrick van Meurs
‹ Prev 1 4 5 6 7 8 10 Next ›