Related papers: Comment on ``Monte Carlo Algorithms with Absorbing…

This paper is Comment on the paper: S.A.R. Horsley and M. Babiker, Phys. Rev. Lett. 95, 010405 (2005).

I comment on a paper by S. B. Goryachev [PRL vol 72, p.1850 (1994)] that presents a theory of non-equilibrium dynamics for scalar systems quenched into an ordered phase. Goryachev incorrectly applies only a global conservation constraint to…

This paper has been withdrawn by the author due to a crucial accuracy error in Fig. 5. For precise performance of ALBNN please refer to Yoon et al.'s work in the following article. Yoon, H., Park, C. S., Kim, J. S., & Baek, J. G. (2013).…

Computational procedures for the stationary probability distribution, the group inverse of the Markovian kernel and the mean first passage times of an irreducible Markov chain, are developed using perturbations. The derivation of these…

Switching dynamical systems are an expressive model class for the analysis of time-series data. As in many fields within the natural and engineering sciences, the systems under study typically evolve continuously in time, it is natural to…

This article presents a short and concise description of stochastic approximation algorithms in reinforcement learning of Markov decision processes. The algorithms can also be used as a suboptimal method for partially observed Markov…

Quantum algorithms offer the potential for significant computational advantages; however, in many cases, it remains unclear how these advantages can be practically realized. Causal Set Theory is a discrete, Lorentz-invariant approach to…

Corrigenda to "$L^p$ estimates and asymptotic behavior for finite energy solutions of extremals to Hardy-Sobolev inequalities", Trans. Amer. Math. Soc. 363 (2011), no. 1, 37--62.

Some mathematical errors of the paper commented upon [W.-M. Suen, Phys. Rev. D 40, (1989) 315] are corrected.

We correct an inaccuracy in a previous article [Auscher, Pascal; Bernicot, Fr\'ed\'eric; Zhao, Jiman. Maximal regularity and Hardy spaces. Collect. Math. 59 (2008), no. 1, 103-127.]

Variational quantum algorithms are poised to have significant impact on high-dimensional optimization, with applications in classical combinatorics, quantum chemistry, and condensed matter. Nevertheless, the optimization landscape of these…

We present a direct derivation of the theorem of M. Maxwell and M. Woodroofe (Ann. Probab. 28 (2000) 713-724), on martingale approximation of additive functionals of stationary Markov processes, from the non-reversible version of the…

In the note two errors in Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence", "IEEE/ACM Transactions on Networking", 7(6), pp. 861-874, 1999, are shown. Because of these errors the proofs of both…

We introduce a framework for efficient Markov Chain Monte Carlo (MCMC) algorithms targeting discrete-valued high-dimensional distributions, such as posterior distributions in Bayesian variable selection (BVS) problems. We show that many…

Latent space models are popular for analyzing dynamic network data. We propose a variational approach to estimate the model parameters as well as the latent positions of the nodes in the network. The variational approach is much faster than…

In the context of Monte Carlo sampling for lattice models, the complexity of the energy landscape often leads to Markov chains being trapped in local optima, thereby increasing the correlation between samples and reducing sampling…

Adaptive Markov chains are an important class of Monte Carlo methods for sampling from probability distributions. The time evolution of adaptive algorithms depends on past samples, and thus these algorithms are non-Markovian. Although there…

We develop a novel Markov chain Monte Carlo (MCMC) method that exploits a hierarchy of models of increasing complexity to efficiently generate samples from an unnormalized target distribution. Broadly, the method rewrites the Multilevel…

In this note, it is shown that the results claimed in the paper [1]---as well as the examples presented there---are, unfortunately, incorrect.

In [C. Mouhot and L. Pareschi, "Fast algorithms for computing the Boltzmann collision operator," Math. Comp., to appear; C. Mouhot and L. Pareschi, C. R. Math. Acad. Sci. Paris, 339 (2004), pp. 71-76], fast deterministic algorithms based on…