Related papers: Population Annealing Simulations of a Binary Hard …
Binary interactions lead to the formation of intriguing objects, such as compact binaries, supernovae, gamma ray bursts, X-ray binaries, pulsars, novae, cataclysmic variables, hot subdwarf stars, barium stars, and blue stragglers. To study…
We introduce an algorithm to generate (not solve) spin-glass instances with planted solutions of arbitrary size and structure. First, a set of small problem patches with open boundaries is solved either exactly or with a heuristic, and then…
There are at least two formation scenarios consistent with the first gravitational-wave observations of binary black hole mergers. In field models, black hole binaries are formed from stellar binaries that may undergo common envelope…
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction…
The ability to evaluate the outcomes of quantum annealers is essential for such devices to be used in complex computational tasks. We introduce a statistical test of the quality of Ising-based annealers' output based on the data only,…
Mixture models provide a flexible representation of heterogeneity in a finite number of latent classes. From the Bayesian point of view, Markov Chain Monte Carlo methods provide a way to draw inferences from these models. In particular,…
A continuous-time projection quantum Monte Carlo algorithm is employed to simulate the ground state of a short-range quantum spin-glass model, namely, the two-dimensional Edwards-Anderson Hamiltonian with transverse field, featuring…
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte…
The Numerical Assembly Technique is extended to investigate arbitrary planar frame structures with the focus on the computation of natural frequencies. This allows us to obtain highly accurate results without resorting to spatial…
Classical and quantum annealing is discussed for a kinetically constrained chain of $N$ non-interacting asymmetric double wells, represented by Ising spins in a longitudinal field $h$. It is shown that in certain cases, where the kinetic…
We use discontinuous molecular dynamics and grand-canonical transition-matrix Monte Carlo simulations to explore how confinement between parallel hard walls modifies the relationships between packing fraction, self-diffusivity, partial…
Context: Globular clusters (GCs) host multiple populations characterised by abundance variations in a number of light elements. In many cases, these populations also show spatial and/or kinematic differences, which vary in strength from…
Especially in lattice structured populations, homogeneous mixing represents an inadequate assumption. Various improvements upon the ordinary pair approximation based on a number of assumptions concerning the higher-order correlations have…
Population balance framework is a useful tool that can be used to describe size distribution of droplets in a liquid-liquid dispersion. Breakup and coalescence models provide closures for mathematical formulation of the population balance…
We adapt the simulated annealing algorithm to the search of periodic orbits for classical multi-electron atomic systems. This is done by minimizing the n-th return distance to the initial position on a Poincare surface of section under an…
The influence of strain amplitude, glass stability and thermal fluctuations on shear band formation and yielding transition is studied using molecular dynamics simulations. The model binary mixture is first gradually cooled below the glass…
We calculate ground-state properties of a many-quark system in the string-flip model using variational Monte Carlo methods. The many-body potential energy of the system is determined by finding the optimal grouping of quarks into hadrons.…
The feasibility pump algorithm is an efficient primal heuristic for finding feasible solutions to mixed-integer programming problems. The algorithm suffers mainly from fast convergence to local optima. In this paper, we investigate the…
Population protocols are a distributed computation model in which a collection of anonymous, finite-state agents interact in randomly chosen pairs and update their states according to a fixed transition function. The computation is defined…
We propose a modeling framework for binary-choice dynamics in which agents update their states using two mechanisms selected based on individual preference drawn from an arbitrary distribution. We compare annealed dynamics, where…