Related papers: Efficient kinetic Monte Carlo method for reaction-…
A Monte Carlo model of radiative transfer in multi-phase dusty media is applied to the situation of stars and clumpy dust in a sphere or a disk. The distribution of escaping and absorbed photons are shown for various filling factors and…
In this work, we present an extensive computational study on the Ziff-Gulari-Barshad (ZGB) model extended in order to include the spatial diffusion of oxygen atoms and carbon monoxide molecules, both adsorbed on the surface. In our…
We develop exact Markov chain Monte Carlo methods for discretely-sampled, directly and indirectly observed diffusions. The qualification "exact" refers to the fact that the invariant and limiting distribution of the Markov chains is the…
We develop diffusion-based samplers for target distributions known up to a normalising constant. To this end, we rely on the well-known diffusion path that smoothly interpolates between a simple base distribution and the target, popularised…
Diffusion of interstitial alloying elements like H, O, C, and N in metals and their continuous relocation and interactions with their microstructures have crucial influences on metals properties. However, besides limitations in experimental…
We present a new algorithm for radiative transfer-based on a statistical Monte Carlo approach-that does not suffer from teleportation effects, on the one hand, and yields smooth results, on the other hand. Implicit Monte Carlo (IMC)…
Sequential Monte Carlo algorithms, or Particle Filters, are Bayesian filtering algorithms which propagate in time a discrete and random approximation of the a posteriori distribution of interest. Such algorithms are based on Importance…
Most research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians, whose ground states can be expressed with only real, nonnegative amplitudes. This raises the question of whether classical Monte Carlo algorithms…
Particle-based kinetic Monte Carlo simulations of neutral particles is one of the major computational bottlenecks in tokamak scrape-off layer simulations. This computational cost comes from the need to resolve individual collision events in…
To better understand the capture process by a nanopore, we introduce an efficient Kinetic Monte Carlo (KMC) algorithm that can simulate long times and large system sizes by mapping the dynamic of a point-like particle in a 3D spherically…
In this paper we introduce and discuss numerical schemes for the approximation of kinetic equations for flocking behavior with phase transitions that incorporate uncertain quantities. This class of schemes here considered make use of a…
Microscopic processes on surfaces such as adsorption, desorption, diffusion and reaction of interacting particles can be simulated using kinetic Monte Carlo (kMC) algorithms. Even though kMC methods are accurate, they are computationally…
This paper introduces and analyses interacting underdamped Langevin algorithms, termed Kinetic Interacting Particle Langevin Monte Carlo (KIPLMC) methods, for statistical inference in latent variable models. We propose a diffusion process…
We analyze the line radiative transfer in protoplanetary disks using several approximate methods and a well-tested Accelerated Monte Carlo code. A low-mass flaring disk model with uniform as well as stratified molecular abundances is…
We discuss the problem of ultra high energy particles propagation in astrophysical backgrounds. We present two different computational schemes based on both kinetic and Monte Carlo approaches. The kinetic approach is an analytical…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
An efficient Monte Carlo simulation method for bosonic reaction-diffusion systems which are mainly used in the renormalization group (RG) study is proposed. Using this method, one dimensional bosonic single species annihilation model is…
High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local…
Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the…
A novel hybrid Monte Carlo transport scheme is demonstrated in a scene with solar illumination, scattering and absorbing 2D atmosphere, a textured reflecting mountain, and a small detector located in the sky (mounted on a satellite or a…