Related papers: Recoil growth: an efficient simulation method for …
In this manuscript, we describe a new configurational bias Monte Carlo technique for the simulation of peptides. We focus on the biologically relevant cases of linear and cyclic peptides. Our approach leads to an efficient,…
As the size of engineered systems grows, problems in reliability theory can become computationally challenging, often due to the combinatorial growth in the cut sets. In this paper we demonstrate how Multilevel Monte Carlo (MLMC) - a…
Hamiltonian Monte Carlo is a prominent Markov Chain Monte Carlo algorithm, which employs symplectic integrators to sample from high dimensional target distributions in many applications, such as statistical mechanics, Bayesian statistics…
The pivot algorithm is the most efficient known method for sampling polymer configurations for self-avoiding walks and related models. Here we introduce two recent improvements to an efficient binary tree implementation of the pivot…
Radiative transfer simulation is an important tool that allows us to generate synthetic images of various astrophysical objects. In the case of complex three-dimensional geometries, a Monte Carlo-based method that simulates photon packages…
We propose a Markov chain Monte Carlo-based deconvolution method designed to estimate the number of peaks in spectral data, along with the optimal parameters of each radial basis function. Assuming cases where the number of peaks is…
An adaptive Monte Carlo localization algorithm based on coevolution mechanism of ecological species is proposed. Samples are clustered into species, each of which represents a hypothesis of the robots pose. Since the coevolution between the…
Recent developments of microscopic mechanical experiments allow the manipulation of individual polymer molecules in two main ways: \textit{uniform} stretching by external forces and \textit{non-uniform} stretching by external fields. Many…
A polymer chain containing $N$ monomers confined in a finite cylindrical tube of diameter $D$ grafted at a distance $L$ from the open end of the tube may undergo a rather abrupt transition, where part of the chain escapes from the tube to…
We propose a Multi-Cell Monte Carlo algorithm, or (MC)^2, for predicting stable phases in chemically complex crystalline systems. Free atomic transfer among cells is achieved via the application of the lever rule, where an assigned molar…
The Markov Chain Monte Carlo (MCMC) algorithm is a widely recognised as an efficient method for sampling a specified posterior distribution. However, when the posterior is multi-modal, conventional MCMC algorithms either tend to become…
Biological tissues are complex structures composed of many elements which make light-based tissue diagnostics challenging. Over the past decades, Monte Carlo technique has been used as a fundamental and versatile approach toward modeling…
We have developed a novel Monte Carlo method for simulating the dynamical evolution of stellar systems in arbitrary geometry. The orbits of stars are followed in a smooth potential represented by a basis-set expansion and perturbed after…
Monte Carlo simulations of coarse-grained polymers provide a useful tool to deepen the understanding of conformational and statistical properties of polymers both in physical as well as in biological systems. In this study we sample compact…
Markov chain Monte Carlo (MCMC) algorithms have become powerful tools for Bayesian inference. However, they do not scale well to large-data problems. Divide-and-conquer strategies, which split the data into batches and, for each batch, run…
A rigourous Monte Carlo method for protein folding simulation on lattice model is introduced. We show that a parameter which can be seen as the rigidity of the conformations has to be introduced in order to satisfy the detailed balance…
Polymer-assisted ion transport underpins both energy storage technologies and emerging neuromorphic computing devices. Efficient modeling of ion migration is essential for understanding the performance of batteries and memristors, but it…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
Monte Carlo simulations are an essential tool in particle physics data analysis. Events are typically generated alongside weights that redistribute the cross section of the simulated process across the phase space. These weights can be…
Polymer chains undergoing a continuous adsorption-desorption transition are studied through extensive computer simulations. A three-dimensional self-avoiding walk lattice model of a polymer chain grafted onto a surface has been treated for…