Related papers: An efficient Cellular Potts Model algorithm that f…
The problem of simulating the thermal behavior of quantum systems remains a central open challenge in quantum computing. Unlike well-established quantum algorithms for unitary dynamics, \emph{provably efficient} algorithms for preparing…
The simulation of diffusion-based molecular communication systems with absorbing receivers often requires a high computational complexity to produce accurate results. In this work, a new a priori Monte Carlo (APMC) algorithm is proposed to…
We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to…
The results of numerical simulation using a modified Monte Carlo method with a heat bath algorithm for the pseudospin model of cuprates are presented. The temperature phase diagrams are constructed for various degrees of doping and for…
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…
Profit maximization (PM) is to select a subset of users as seeds for viral marketing in online social networks, which balances between the cost and the profit from influence spread. We extend PM to that under the general marketing strategy,…
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…
We present a study of the parallel tempering (replica exchange) Monte Carlo method, with special focus on the feedback-optimized parallel tempering algorithm, used for generating an optimal set of simulation temperatures. This method is…
Particle-in-cell merging algorithms aim to resample dynamically the six-dimensional phase space occupied by particles without distorting substantially the physical description of the system. Whereas various approaches have been proposed in…
Monte Carlo simulations of lattice quantum field theories on Lefschetz thimbles are non trivial. We discuss a new Monte Carlo algorithm based on the idea of computing contributions to the functional integral which come from complete flow…
For $d \ge 2$ and all $q\geq q_{0}(d)$ we give an efficient algorithm to approximately sample from the $q$-state ferromagnetic Potts and random cluster models on finite tori $(\mathbb Z / n \mathbb Z )^d$ for any inverse temperature…
It is well known that the number of particles should be scaled up to enable industrial scale simulation. The calculations are more computationally intensive when the motion of the surrounding fluid is considered. Besides the advances in…
Resampling is a standard step in particle filters and more generally sequential Monte Carlo methods. We present an algorithm, called chopthin, for resampling weighted particles. In contrast to standard resampling methods the algorithm does…
An algorithm is proposed to implement unsteady jump boundary conditions, presenting discontinuity in physical quantities, within the lattice Boltzmann method (LBM). This is useful to tackle problems involving mass or heat transfer through…
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is…
Parallel tempering is a meta-algorithm for Markov Chain Monte Carlo that uses multiple chains to sample from tempered versions of the target distribution, enhancing mixing in multi-modal distributions that are challenging for traditional…
Efficient thermal management is critical for ensuring the safety, performance, and durability of lithium ion pouch cells (LIPCs), particularly under high power operating conditions where conventional battery thermal management systems…
This master thesis introduces the idea of dynamic cutoffs in molecular dynamics simulations, based on the distance between particles and the interface, and presents a solution for detecting interfaces in real-time. Our dynamic cutoff method…
The binary Monte Carlo (MC) collision algorithm is a standard and robust method to include binary Coulomb collision effects in particle-in-cell (PIC) simulations of plasmas. Here, we show that the coupling between PIC and MC algorithms can…
Simulating long-range interacting systems is a challenging task due to its computational complexity that the computational effort for each local update is of order $\cal{O}$$(N)$, where $N$ is the size of system. Recently, a technique,…