相关论文: Directed geometrical worm algorithm applied to the…

We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…

We present a specific algorithm that generally satisfies the balance condition without imposing the detailed balance in the Markov chain Monte Carlo. In our algorithm, the average rejection rate is minimized, and even reduced to zero in…

A framework based on iterative coordinate minimization (CM) is developed for stochastic convex optimization. Given that exact coordinate minimization is impossible due to the unknown stochastic nature of the objective function, the crux of…

We present a geometrically enhanced Markov chain Monte Carlo sampler for networks based on a discrete curvature measure defined on graphs. Specifically, we incorporate the concept of graph Forman curvature into sampling procedures on both…

We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that…

We show how the worldline quantum Monte Carlo procedure, which usually relies on an artificial time discretization, can be formulated directly in continuous time, rendering the scheme exact. For an arbitrary system with discrete Hilbert…

An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of $N>0$. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the…

We review the path-integral quantum Monte Carlo method and discuss its implementation by multiworm algorithms. We analyze in details the features of the algorithms, and focus our attention on the computation of the $N$-body density matrix…

We analyze convergence of gradient-descent methods on Riemannian manifolds. In particular, we study randomization of Riemannian gradient algorithms for minimizing smooth cost functions (of Morse-Bott type). We prove that randomized gradient…

We give a detailed description of the so-called Polynomial Hybrid Monte Carlo (PHMC) algorithm. The effects of the correction factor, which is introduced to render the algorithm exact, are discussed, stressing their relevance for the…

Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…

We provide a detailed description of the path-integral Monte Carlo worm algorithm used to exactly calculate the thermodynamics of Bose systems in the canonical ensemble. The algorithm is fully consistent with periodic boundary conditions,…

We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…

We introduce a new Monte Carlo method by incorporating a guided distribution function to the conventional Monte Carlo method. In this way, the efficiency of Monte Carlo methods is drastically improved. To further speed up the algorithm, we…

A directed animal is a percolation cluster in the directed site percolation model. The aim of this paper is to exhibit a strong relation between the problem of computing the generating function $\G$ of directed animals on the square…

The EM algorithm is a powerful tool for maximum likelihood estimation with missing data. In practice, the calculations required for the EM algorithm are often intractable. We review numerous methods to circumvent this intractability, all of…

A randomized Gram-Schmidt algorithm is developed for orthonormalization of high-dimensional vectors or QR factorization. The proposed process can be less computationally expensive than the classical Gram-Schmidt process while being at least…

Correlated sampling has wide-ranging applications in Monte Carlo calculations. When branching random walks are involved, as commonly found in many algorithms in quantum physics and electronic structure, population control is typically not…

Improved staggered fermion formulations are a popular choice for lattice QCD calculations. Historically, the algorithm used for such calculations has been the inexact R algorithm, which has systematic errors that only vanish as the square…

Orthogonal Monte Carlo (OMC) is a very effective sampling algorithm imposing structural geometric conditions (orthogonality) on samples for variance reduction. Due to its simplicity and superior performance as compared to its Quasi Monte…