Related papers: Monte Carlo simulation of particle interactions at…
Sequential Monte Carlo techniques are useful for state estimation in non-linear, non-Gaussian dynamic models. These methods allow us to approximate the joint posterior distribution using sequential importance sampling. In this framework,…
In nuclear fusion and fission, fluctuation and dissipation arise due to the coupling of collective degrees of freedom with internal excitations. Close to the barrier, both quantum, statistical and non-Markovian effects are expected to be…
We analyze and compare the computational complexity of different simulation strategies for Monte Carlo in the setting of classically scaled population processes. This allows a range of widely used competing strategies to be judged…
A method for computing the thermopower in interacting systems is proposed. This approach, which relies on Monte Carlo simulations, is illustrated first for a diatomic chain of hard-point elastically colliding particles and then in the case…
A simple reweighting scheme is proposed for Monte Carlo simulations of interacting particle systems, permitting one to study various parameter values in a single study, and improving efficiency by an order of magnitude. Unlike earlier…
We demonstrate an approach to solving the coagulation equation that involves using a finite number of moments of the particle size distribution. This approach is particularly useful when only general properties of the distribution, and…
We provide an overview of Monte Carlo algorithms based on Markovian stochastic dynamics of interacting and reacting many-particle systems not in thermal equilibrium. These agent-based simulations are an effective way of introducing students…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
In this paper we present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning…
If a stochastic system during some periods of its evolution can be divided into non-interacting parts, the kinetics of each part can be simulated independently. We show that this can be used in the development of efficient Monte Carlo…
Recently, a diffusion Monte Carlo algorithm was applied to the study of spin dependent interactions in condensed matter. Following some of the ideas presented therein, and applied to a Hamiltonian containing a Rashba-like interaction, a…
We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric…
Monte Carlo methods play important part in modern statistical physics. The application of these methods suffer from two main difficulties.The first is caused by the relatively small number of particles that can participate in any numerical…
We summarize a series of numerical experiments of collisional dynamics in dense stellar systems such as globular clusters (GCs) and in weakly collisional plasmas using a novel simulation technique, the so-called Multi-particle collision…
The conventional theory of homogeneous and heterogeneous nucleation in a supersaturated vapor is tested by Monte Carlo simulations of the lattice gas (Ising) model with nearest-neighbor attractive interactions on the simple cubic lattice.…
We investigate Monte Carlo simulation strategies for determining the effective ("depletion") potential between a pair of hard spheres immersed in a dense sea of much smaller hard spheres. Two routes to the depletion potential are…
In simulations of crystals, unlike liquids or gases, it may happen that the properties of the studied system depend not only on the volume of the simulation cell but also on its shape. For such cases it is desirable to change the shape of…
We present a fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of systems with long-range interactions that reproduces the dynamics of a standard implementation exactly, i.e., the generated configurations and…
We study the formation and evolution of small groups of galaxies using new Monte Carlo simulations. These are directly based on the random walk approach to the statistics of condensations collapsing by gravitational instability, and the…
In this paper we introduce a simple Monte Carlo method for simulating the dynamics of a crowd. Within our model a collection of hard-disk agents is subjected to a series of two-stage steps, implying (i) the displacement of one specific…