Related papers: Population Annealing Simulations of a Binary Hard …
We describe an adaptation of the simulated annealing algorithm to nonparametric clustering and related probabilistic models. This new algorithm learns nonparametric latent structure over a growing and constantly churning subsample of…
We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…
A Bernoulli Mixture Model (BMM) is a finite mixture of random binary vectors with independent dimensions. The problem of clustering BMM data arises in a variety of real-world applications, ranging from population genetics to activity…
Detailed modeling and simulation of biochemical systems is complicated by the problem of combinatorial complexity, an explosion in the number of species and reactions due to myriad protein-protein interactions and post-translational…
A number of scenarios for the formation of multiple populations in globular clusters (GCs) predict that second generation (2G) stars form in a compact and dense subsystem embedded in a more extended first-generation (1G) system. If these…
Quantum annealing with the D-Wave Advantage system in the random Ising model on a cubic lattice is simulated using a three-dimensional (3D) tensor network. The Hamiltonian is driven across a quantum phase transition from a paramagnetic…
We study the distribution of overlaps of glassy minima, taking proper care of residual symmetries of the system. Ensembles of locally stable, low lying glassy states are efficiently generated by rapid cooling from the liquid phase which has…
We present a modification of the Rose-Machta algorithm (Phys. Rev. E 100 (2019) 063304) and estimate the density of states for a two-dimensional Blume-Capel model, simulating $10^5$ replicas in parallel for each set of parameters. We…
Spectral clustering refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. This non-linear transformation of the data is both the key of…
A coherent control scheme for the population distribution in the vibrational states of nonpolar molecules is proposed. Our theoretical analysis and results of numerical simulations for the interaction of the hydrogen molecular ion in its…
Global optimization heuristics are popular to optimize hard non-convex problems. Despite their irrefutably large cost-to-solution, in the lack of other working greedy or convex approaches, global optimization algorithms remain the…
In an earlier paper, we introduced and studied a system of hierarchically interacting measure-valued random processes which describes a large population of individuals carrying types and living in colonies labelled by the hierarchical group…
Nowadays, in our globalized world,the local and intercountry movements of population have been increased. This situation makes it important for host countries to do right predictions for the future population of their native people as well…
Statisticians have recently developed propensity score methods to improve generalizations from randomized experiments that do not employ random sampling. However, these methods typically rely on assumptions whose plausibility may be…
We report an ultrafast and efficient way to create the maximum coherence between the two lower states in a -like atomic systems, driven by two nonlinearly chirped few-cycle pulses. The phenomenon of coherent population trapping and…
To investigate the cluster glass phase of ultrasoft particles, we examine an annealed two-replica system endowed with an attractive inter-replica field similar to that of a binary symmetric electrolyte. Leveraging this analogy, we conduct…
We demonstrate that is it possible to simulate a system in thermal equilibrium even when the energy cannot be evaluated exactly, provided the error distribution is known. This leads to an effective optimisation strategy for problems where…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
Consider a graph whose vertices are populated by identical objects, together with an algorithm for the time-evolution of the number of objects placed at each of the vertices. The discrete dynamics of these objects can be observed and…
We study the Biroli-Mezard model for lattice glasses on a number of hierarchical networks. These networks combine certain lattice-like features with a recursive structure that makes them suitable for exact renormalization group studies and…