Related papers: Irreversible swap algorithms for soft sphere glass…
Policy-guided Monte Carlo is an adaptive method to simulate classical interacting systems. It adjusts the proposal distribution of the Metropolis-Hastings algorithm to maximize the sampling efficiency, using a formalism inspired by…
The reformulation of the mode-coupling theory (MCT) of the liquid-glass transition which incorporates the element of metastability is applied to the hard-sphere system. It is shown that the glass transition in this system is not a sharp one…
We simulate the dynamics of polydisperse hard spheres at high packing fractions, $\phi$, with an experimentally-realistic particle size distribution (PSD) and other commonly-used PSDs such as gaussian or top hat. We find that the mode of…
In particle-based computer simulations of polydisperse glassforming systems, the particle diameters $\sigma = \sigma_1, \dots, \sigma_N$ of a system with $N$ particles are chosen with the intention to approximate a desired distribution…
In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…
We discuss the distributed matching scheme in accelerators where control of transverse beam phase space, oscillation, and transport is accomplished by flexible distribution of focusing elements beyond dedicated matching sections. Besides…
We examine the optimal scaling and the efficiency of the pseudo-marginal random walk Metropolis algorithm using a recently-derived result on the limiting efficiency as the dimension, $d\rightarrow \infty$. We prove that the optimal scaling…
We discuss the rejection-free event-chain Monte-Carlo algorithm and several applications to dense soft matter systems. Event-chain Monte-Carlo is an alternative to standard local Markov-chain Monte-Carlo schemes, which are based on detailed…
Electromechanical switching devices such as relays, solenoid valves, and contactors offer several technical and economic advantages that make them widely used in industry. However, uncontrolled operations result in undesirable…
In complex systems such as spin systems and protein systems, conventional simulations in the canonical ensemble will get trapped in states of energy local minima. We employ the generalized-ensemble algorithms in order to overcome this…
We propose a new type of effective densities via the potential distribution theorem. These densities are for the sake of enabling the mapping of the free energy of a uniform fluid onto that of a nonuniform fluid. The potential distribution…
We present explicit methods for simulating diffusions whose generator is self-adjoint with respect to a known (but possibly not normalizable) density. These methods exploit this property and combine an optimized Runge-Kutta algorithm with a…
Simulating long-range interacting systems is a challenging task due to its computational complexity that the computational effort for each local update is of order $\cal{O}$$(N)$, where $N$ is the size of system. Recently, a technique,…
Effective pair interactions with a soft-repulsive component are a well-known feature of polymer solutions and colloidal suspensions, but they also provide a key to interpret the high-pressure behaviour of simple elements. We have computed…
Various Markov chain Monte Carlo (MCMC) methods are studied to improve upon random walk Metropolis sampling, for simulation from complex distributions. Examples include Metropolis-adjusted Langevin algorithms, Hamiltonian Monte Carlo, and…
We study by molecular dynamics computer simulation a binary soft-sphere mixture that shows a pronounced decoupling of the species' long-time dynamics. Anomalous, power-law-like diffusion of small particles arises, that can be understood as…
Parallel tempering, also known as replica exchange sampling, is an important method for simulating complex systems. In this algorithm simulations are conducted in parallel at a series of temperatures, and the key feature of the algorithm is…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
The phase diagram of soft spheres with size dispersion has been studied by means of an optimized Monte Carlo algorithm which allows to equilibrate below the kinetic glass transition for all sizes distribution. The system ubiquitously…
The rigid to floppy transitions and the associated intermediate phase in glasses are studied in the case where the local structure is not fully determined from the macroscopic concentration. The approach uses size increasing cluster…