Related papers: On the optimal relaxation rate for the Metropolis …
We consider versions of the Metropolis algorithm which avoid the inefficiency of rejections. We first illustrate that a natural Uniform Selection Algorithm might not converge to the correct distribution. We then analyse the use of Markov…
We analytically and numerically study a fourth order PDE modeling rough crystal surface diffusion on the macroscopic level. We discuss existence of solutions globally in time and long time dynamics for the PDE model. The PDE, originally…
Phase transitions appear all over science, and are familiar from everyday life, as water boiling, sugar melting into caramel or as nematic molecules turning smectic in liquid-crystal displays. The dynamics of phase transitions can be…
In this article, we briefly review the studies on magnetic relaxation behaviours. The theoretical as well as experimental investigations are reported briefly. A major part of this article is devoted to the recent Monte Carlo investigations…
We study the dynamical exponents $d_{w}$ and $d_{s}$ for a particle diffusing in a disordered medium (modeled by a percolation cluster), from the regime of extreme disorder (i.e., when the percolation cluster is a fractal at $p=p_{c}$) to…
We discuss non-reversible Markov-chain Monte Carlo algorithms that, for particle systems, rigorously sample the positional Boltzmann distribution and that have faster than physical dynamics. These algorithms all feature a non-thermal…
Markov chain Monte Carlo methods such as Gibbs sampling and simple forms of the Metropolis algorithm typically move about the distribution being sampled via a random walk. For the complex, high-dimensional distributions commonly encountered…
Traditionally, systems governed by linear Partial Differential Equations (PDEs) are spatially discretized to exploit their algebraic structure and reduce the computational effort for controlling them. Due to beneficial insights of the PDEs,…
Recently, the present authors proposed the nonequilibrium-to-equilibrium scaling (NE-ES) scheme for critical Monte Carlo relaxation process, which scales relaxation data in the whole simulation-time regions regardless of functional forms,…
We perform numerical simulations to study static and dynamic critical behaviour of the 3d random-site Ising model. A distinct feature of our approach is a combination of the Metropolis, Swendsen-Wang, and Wolff Monte Carlo algorithms. For…
Multiple-try Metropolis (MTM) is a popular Markov chain Monte Carlo method with the appealing feature of being amenable to parallel computing. At each iteration, it samples several candidates for the next state of the Markov chain and…
It is well known that for ergodic channel processes the Generalized Max-Weight Matching (GMWM) scheduling policy stabilizes the network for any supportable arrival rate vector within the network capacity region. This policy, however, often…
There has been considerable interest in designing Markov chain Monte Carlo algorithms by exploiting numerical methods for Langevin dynamics, which includes Hamiltonian dynamics as a deterministic case. A prominent approach is Hamiltonian…
We introduce a derivative-free global optimization algorithm that efficiently computes minima for various classes of one-dimensional functions, including non-convex, and non-smooth functions.This algorithm numerically approximates the…
The self-healing diffusion Monte Carlo algorithm (SHDMC) [Reboredo, Hood and Kent, Phys. Rev. B {\bf 79}, 195117 (2009); Reboredo, {\it ibid.} {\bf 80}, 125110 (2009)] is extended to study the ground and excited states of magnetic and…
Couplings play a central role in the analysis of Markov chain Monte Carlo algorithms and appear increasingly often in the algorithms themselves, e.g. in convergence diagnostics, parallelization, and variance reduction techniques. Existing…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
The expectation--maximization (EM) algorithm combines global monotonicity, local linear convergence, and strong practical robustness, but these features are usually analyzed separately. Global descent is nonlinear, whereas local convergence…
Part I of this work [2] developed the exact diffusion algorithm to remove the bias that is characteristic of distributed solutions for deterministic optimization problems. The algorithm was shown to be applicable to a larger set of…
With a nonequilibrium relaxation method, we calculate the dynamic critical exponent z of the two-dimensional Ising model for the Swendsen-Wang and Wolff algorithms. We examine dynamic relaxation processes following a quench from a…