Related papers: A new time quantifiable Monte Carlo method in simu…
Detailed mean field and Monte Carlo studies of the dynamic magnetization-reversal transition in the Ising model in its ordered phase under a competing external magnetic field of finite duration have been presented here. Approximate…
We consider the inverse problem of estimating the initial condition of a partial differential equation, which is only observed through noisy measurements at discrete time intervals. In particular, we focus on the case where Eulerian…
Lattice simulations are an important class of problems in crystalline solids, surface science, alloys, adsorption, absorption, separation, catalysis, to name a few. We describe a fast computational method for performing lattice…
The Monte Carlo method in the canonical ensemble is used to investigate magnetization reversal in amorphous transition metal - rare earth multilayers. Our study is based on a model containing diluted clusters which exhibit an effective…
We introduce the Quantization Monte Carlo method to solve thermal radiative transport equations with possibly several collision regimes, ranging from few collisions to massive number of collisions per time unit. For each particle in a given…
Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of the target, but it…
We make progress towards a 3D finite-element model for the magnetization of a high temperature superconductor (HTS): We suggest a method that takes into account demagnetisation effects and flux creep, while it neglects the effects…
Monte Carlo studies involving real time dynamics are severely restricted by the sign problem that emerges from highly oscillatory phase of the path integral. In this letter, we present a new method to compute real time quantities on the…
Langevin algorithms are popular Markov chain Monte Carlo (MCMC) methods for large-scale sampling problems that often arise in data science. We propose Monte Carlo algorithms based on the discretizations of $P$-th order Langevin dynamics for…
We develop a diagrammatic Monte Carlo method for the real-time dynamics of dissipative quantum impurity models. These are small open quantum systems with interaction and local Markovian dissipation, coupled to a large quantum bath. Our…
We propose a new strategy for Monte Carlo (MC) optimization on rugged multidimensional landscapes. The strategy is based on querying the statistical properties of the landscape in order to find the temperature at which the mean first…
We propose a sampling-based framework for finite-horizon trajectory and policy optimization under differentiable dynamics by casting controller design as inference. Specifically, we minimize a KL-regularized expected trajectory cost, which…
Numerical integration of a stochastic Landau-Lifshitz-Gilbert equation is used to study dynamic processes in single-domain nanoscale magnets at nonzero temperatures. Special attention is given to including thermal fluctuations as a Langevin…
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…
We propose a novel sequential Monte Carlo (SMC) method for sampling from unnormalized target distributions based on a reverse denoising diffusion process. While recent diffusion-based samplers simulate the reverse diffusion using…
In this paper, we suggest a novel sampling method for Monte Carlo molecular simulations. In order to perform efficient sampling of molecular systems, it is advantageous to avoid extremely high energy configurations while also retaining the…
The recently-introduced self-learning Monte Carlo method is a general-purpose numerical method that speeds up Monte Carlo simulations by training an effective model to propose uncorrelated configurations in the Markov chain. We implement…
We present iterative Monte Carlo algorithm for which the temperature variable is attracted by a critical point. The algorithm combines techniques of single histogram reweighting and linear filtering. The 2d Ising model of ferromagnet is…
A new Monte Carlo algorithm is introduced for the simulation of supercooled liquids and glass formers, and tested in two model glasses. The algorithm is shown to thermalize well below the Mode Coupling temperature and to outperform other…
The stochastic series expansion quantum Monte Carlo method is used to study thin ferromagnetic films, described by a Heisenberg model including local anisotropies. The magnetization curve is calculated, and the results compared to Schwinger…