Related papers: Complex Langevin Dynamics and Supersymmetric Quant…
We study three possible ways to circumvent the sign problem in the O(3) nonlinear sigma model in 1+1 dimensions. We compare the results of the worm algorithm to complex Langevin and multiparameter reweighting. Using the worm algorithm, the…
Recently it has been questioned, notably in the context of the scalar singlet dark matter model with $m_\varphi^{ }\simeq 60$ GeV, how efficiently kinetic equilibrium is maintained if freeze-out dynamics is pushed down to low temperatures…
Monte Carlo methods cannot probe far into the QCD phase diagram with a real chemical potential, due to the famous sign problem. Complex Langevin simulations, using adaptive step-size scaling and gauge cooling, are suited for sampling path…
The three-dimensional XY model is studied at finite chemical potential using complex Langevin dynamics. The validity of the approach is probed at small chemical potential using imaginary chemical potential and continuity arguments, and at…
A supersymmetric path integral representation is developed for stochastic processes whose Langevin equation contains any number N of time derivatives, thus generalizing the Langevin equation with inertia studied by Kramers, where N=2. The…
The kinetic Langevin dynamics finds diverse applications in various disciplines such as molecular dynamics and Hamiltonian Monte Carlo sampling. In this paper, a novel splitting scalar auxiliary variable (SSAV) scheme is proposed for the…
Recently there has been remarkable progress in solving the sign problem, which occurs in investigating statistical systems with a complex weight. The two promising methods, the complex Langevin method and the Lefschetz thimble method, share…
We present a novel strategy to strongly reduce the severity of the sign problem, using line integrals along paths of changing imaginary action. Highly oscillating regions along these paths cancel out, decreasing their contributions. As a…
Constrained sampling is an important and challenging task in computational statistics, concerned with generating samples from a distribution under certain constraints. There are numerous types of algorithm aimed at this task, ranging from…
We present a simulation strategy for the real-time dynamics of quantum fields, inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information, a necessary prerequisite…
The complex Langevin method is a promising approach to the complex-action problem based on a fictitious time evolution of complexified dynamical variables under the influence of a Gaussian noise. Although it is known to have a restricted…
In molecular dynamics, penalized overdamped Langevin dynamics are used to model the motion of a set of particles that follow constraints up to a parameter $\varepsilon$. The most used schemes for simulating these dynamics are the Euler…
We study the quantum dynamics of optical fields in weakly confining resonators with overlapping modes. Employing a recently developed quantization scheme involving a discrete set of resonator modes and continua of external modes we derive…
Recently, the task of image generation has attracted much attention. In particular, the recent empirical successes of the Markov Chain Monte Carlo (MCMC) technique of Langevin Dynamics have prompted a number of theoretical advances; despite…
Symmetries are ubiquitous across all kinds of objects, whether in nature or in man-made creations. While these symmetries may seem intuitive to the human eye, detecting them with a machine is nontrivial due to the vast search space.…
When analyzing the equilibrium properties of a stochastic process, identifying the parity of the variables under time-reversal is imperative. This initial step is required to assess the presence of detailed balance, and to compute the…
We show how to write a set of brackets for the Langevin equation, describing the dissipative motion of a classical particle, subject to external random forces. The method does not rely on an action principle, and is based solely on the…
Monte Carlo simulation of gauge theories with a $\theta$ term is known to be extremely difficult due to the sign problem. Recently there has been major progress in solving this problem based on the idea of complexifying dynamical variables.…
Recent rapid advances in single particle tracking and supercomputing techniques resulted in an unprecedented abundance of diffusion data exhibiting complex behaviours, such the presence of power law tails of the msd and memory functions,…
Effective Polyakov line models, derived from SU(3) gauge-matter systems at finite chemical potential, have a sign problem. In this article I solve two such models, derived from SU(3) gauge-Higgs and heavy quark theories by the relative…