Related papers: On the optimal relaxation rate for the Metropolis …
We study the rate of convergence to equilibrium of the self-repellent random walk and its local time process on the discrete circle $\mathbb{Z}_n$. While the self-repellent random walk alone is non-Markovian since the jump rates depend on…
The uniform sampling of convex regions in high dimension is an important computational issue, from both theoretical and applied point of view. The hit-and-run montecarlo algorithms are the most efficient methods known to perform it and one…
We develop a formalism and present an algorithm for optimization of the trial wave-function used in fixed-node diffusion quantum Monte Carlo (DMC) methods. We take advantage of a basic property of the walker configuration distribution…
The Metropolis-Hastings algorithm has been extensively studied in the estimation and simulation literature, with most prior work focusing on convergence behavior and asymptotic theory. However, its covariance structure-an important…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…
This work extends Roberts et al. (1997) by considering limits of Random Walk Metropolis (RWM) applied to block IID target distributions, with corresponding block-independent proposals. The extension verifies the robustness of the optimal…
This paper explores the convergence behavior of two waveform relaxation algorithms, namely the Dirichlet-Neumann and Neumann-Neumann Waveform Relaxation algorithms, for an optimal control problem with a sub-diffusion partial differential…
Considering a real-valued diffusion, a real-valued reward function and a positive discount rate, we provide an algorithm to solve the optimal stopping problem consisting in finding the optimal expected discounted reward and the optimal…
The Rugged Metropolis (RM) algorithm is a biased updating scheme, which aims at directly hitting the most likely configurations in a rugged free energy landscape. Details of the one-variable (RM$_1$) implementation of this algorithm are…
In this paper, we shall optimize the efficiency of Metropolis algorithms for multidimensional target distributions with scaling terms possibly depending on the dimension. We propose a method for determining the appropriate form for the…
The physics of crystalline membranes, i.e. fixed-connectivity surfaces embedded in three dimensions and with an extrinsic curvature term, is very rich and of great theoretical interest. To understand their behavior, numerical simulations…
In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…
The reverse Monte Carlo (RMC) method is widely used in structural modelling and analysis of experimental data. More recently, RMC has been applied to the calculation of equilibrium thermodynamic properties and dynamic problems. These…
The distributed Kaczmarz algorithm is an adaptation of the standard Kaczmarz algorithm to the situation in which data is distributed throughout a network represented by a tree. We isolate substructures of the network and study convergence…
In this paper we shall consider optimal scaling problems for high-dimensional Metropolis--Hastings algorithms where updates can be chosen to be lower dimensional than the target density itself. We find that the optimal scaling rule for the…
Very recently, Transformation based Markov Chain Monte Carlo (TMCMC) was proposed by Dutta and Bhattcharya (2013) as a much efficient alternative to the Metropolis-Hastings algorithm, Random Walk Metropolis (RWM) algorithm, especially in…
A quantum mechanical treatment of an asymmetric double-well potential (DWP) interacting with a heat bath is presented for circumstances where the contribution of higher vibrational levels to the relaxation dynamics cannot be excluded from…
Markov chain Monte Carlo (MCMC) algorithms have played a significant role in statistics, physics, machine learning and others, and they are the only known general and efficient approach for some high-dimensional problems. The random walk…
Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schr\"odinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of $N_w$ walkers, making…
We present explicit methods for simulating diffusions whose generator is self-adjoint with respect to a known (but possibly not normalizable) density. These methods exploit this property and combine an optimized Runge-Kutta algorithm with a…