Related papers: A First-Passage Kinetic Monte Carlo Algorithm for …
The Direct Simulation Monte Carlo (DSMC) method is the gold standard for non-equilibrium rarefied gas dynamics, yet its computational cost can be prohibitive, especially for near-continuum regimes and high-fidelity \emph{ab initio}…
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 study the multi-dimensional radiative transfer phenomena using the ISMC scheme, in both gray and multi-frequency problems. Implicit Monte-Carlo (IMC) schemes have been in use for five decades. The basic algorithm yields teleportation…
Advanced algorithms are necessary to obtain faster-than-real-time dynamic simulations in a number of different physical problems that are characterized by widely disparate time scales. Recent advanced dynamic Monte Carlo algorithms that…
An accurate algorithm is proposed to improve the prediction of a particle in collision with a moving wall within the direct simulation Monte Carlo (DSMC) framework for the simulation of unsteady rarefied flows. This algorithm is able to…
A common way to simulate the transport and spread of pollutants in the atmosphere is via stochastic Lagrangian dispersion models. Mathematically, these models describe turbulent transport processes with stochastic differential equations…
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…
In this article we consider Bayesian parameter inference associated to partially-observed stochastic processes that start from a set B0 and are stopped or killed at the first hitting time of a known set A. Such processes occur naturally…
Fixed node diffusion quantum Monte Carlo (FN-DMC) is an increasingly used computational approach for investigating the electronic structure of molecules, solids, and surfaces with controllable accuracy. It stands out among equally accurate…
Particle Markov Chain Monte Carlo (PMCMC) is a general computational approach to Bayesian inference for general state space models. Our article scales up PMCMC in terms of the number of observations and parameters by generating the…
Markov Chain Monte Carlo (MCMC) algorithms play an important role in statistical inference problems dealing with intractable probability distributions. Recently, many MCMC algorithms such as Hamiltonian Monte Carlo (HMC) and Riemannian…
Diffusion Monte Carlo (DMC) simulations for fermions are becoming the standard to provide high quality reference data in systems that are too large to be investigated via quantum chemical approaches. DMC with the fixed-node approximation…
In this work, we address the systematic biases and random errors stemming from finite step sizes encountered in diffusion simulations. We introduce the Effective Geometry Monte Carlo (EG-MC) simulation algorithm which modifies the geometry…
A challenging problem in probabilistic programming is to develop inference algorithms that work for arbitrary programs in a universal probabilistic programming language (PPL). We present the nonparametric involutive Markov chain Monte Carlo…
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…
We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dynamical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix.…
We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler…
In this article we study examples of systematic biases that can occur in quantum Monte Carlo methods due to the accumulation of non-linear expectation values, and approaches by which these errors can be corrected. We begin with a study of…
In plasma edge simulations, kinetic Monte Carlo (MC) is often used to simulate neutral particles and estimate source terms. For large-sized reactors, like ITER and DEMO, high particle collision rates lead to a substantial computational cost…
Bayesian phylogenetic inference is often conducted via local or sequential search over topologies and branch lengths using algorithms such as random-walk Markov chain Monte Carlo (MCMC) or Combinatorial Sequential Monte Carlo (CSMC).…