Related papers: Understanding population annealing Monte Carlo sim…
In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Diffusion limited aggregation and several…
Computer simulations of complex population genetic models are an essential tool for making sense of the large-scale datasets of multiple genome sequences from a single species that are becoming increasingly available. A widely used approach…
Combinatorial optimization problems are crucial for widespread applications but remain difficult to solve on a large scale with conventional hardware. Novel optical platforms, known as coherent or photonic Ising machines, are attracting…
Recently a new algorithm for sampling posteriors of unnormalised probability densities, called ABC Shadow, was proposed in [8]. This talk introduces a global optimisation procedure based on the ABC Shadow simulation dynamics. First the…
Approximate Bayes Computations (ABC) are used for parameter inference when the likelihood function of the model is expensive to evaluate but relatively cheap to sample from. In particle ABC, an ensemble of particles in the product space of…
The paper presents an investigation of estimating treatment effect using different matching methods. The study proposed a new method which is computationally efficient and convenient in implication-'largest caliper matching' and compared…
Simulated quantum annealing is a generic classical protocol to simulate some aspects of quantum annealing and is sometimes regarded as a classical alternative to quantum annealing in finding the ground state of a classical Ising model. We…
We discuss different approaches for studying the influence of disorder in the three-dimensional Ising model. From the theoretical point of view, renormalisation group calculations provide quite accurate results. Experiments carried out on…
Relations of simulated annealing and quantum annealing are studied by a mapping from the transition matrix of classical Markovian dynamics of the Ising model to a quantum Hamiltonian and vice versa. It is shown that these two operators, the…
Non-equilibrium dynamics of the Ising model is a classical stochastic process whereas quantum mechanics has no stochastic elements in the classical sense. Nevertheless, it has been known that there exists a close formal relationship between…
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…
In this paper we present an extension of population-based Markov chain Monte Carlo (MCMC) to the trans-dimensional case. One of the main challenges in MCMC-based inference is that of simulating from high and trans-dimensional target…
Metaheuristics, as the simulated annealing used in the optimization of disordered systems, goes beyond physics, and the traveling salesman is a paradigmatic NP-complete problem that allows inferring important theoretical properties of the…
Particle filters provide Monte Carlo approximations of intractable quantities such as point-wise evaluations of the likelihood in state space models. In many scenarios, the interest lies in the comparison of these quantities as some…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
Sequential Monte Carlo methods, also known as particle methods, are a popular set of techniques for approximating high-dimensional probability distributions and their normalizing constants. These methods have found numerous applications in…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior combinatorial optimization…
The strongest evidence for superiority of quantum annealing on spin glass problems has come from comparing simulated quantum annealing using quantum Monte Carlo (QMC) methods to simulated classical annealing [G. Santoro et al., Science 295,…
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte…