Abstract
For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal form for the class of algorithms which generate local moves in the configuration space. We explicitly calculate the distance for the Langevin algorithm, and show that it certainly has desired and expected properties as distance. We further show that the distance for a multimodal distribution gets dramatically reduced from a large value by the introduction of a tempering method. We also argue that, when the original distribution is highly multimodal with large number of degenerate vacua, an anti-de Sitter-like geometry naturally emerges in the extended configuration space.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Creutz, Overrelaxation and Monte Carlo Simulation, Phys. Rev. D 36 (1987) 515 [INSPIRE].
E. Marinari and G. Parisi, Simulated tempering: A new Monte Carlo scheme, Europhys. Lett. 19 (1992) 451 [hep-lat/9205018] [INSPIRE].
R.H. Swendsen and J.-S. Wang, Replica Monte Carlo Simulation of Spin-Glasses, Phys. Rev. Lett. 57 (1986) 2607.
C.J. Geyer, Markov Chain Monte Carlo Maximum Likelihood, in Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface, American Statistical Association, New York, U.S.A. (1991).
D.J. Earl and M.W. Deem, Parallel tempering: Theory, applications, and new perspectives, Phys. Chem. Chem. Phys. 7 (2005) 3910.
S. Duane, A.D. Kennedy, B.J. Pendleton and D. Roweth, Hybrid Monte Carlo, Phys. Lett. B 195 (1987) 216 [INSPIRE].
G. Aarts, Introductory lectures on lattice QCD at nonzero baryon number, J. Phys. Conf. Ser. 706 (2016) 022004 [arXiv:1512.05145] [INSPIRE].
M. Fukuma, N. Matsumoto and N. Umeda, work in progress.
G. Parisi, On Complex Probabilities, Phys. Lett. B 131 (1983) 393 [INSPIRE].
G. Aarts, L. Bongiovanni, E. Seiler, D. Sexty and I.-O. Stamatescu, Controlling complex Langevin dynamics at finite density, Eur. Phys. J. A 49 (2013) 89 [arXiv:1303.6425] [INSPIRE].
J. Bloch, Reweighting complex Langevin trajectories, Phys. Rev. D 95 (2017) 054509 [arXiv:1701.00986] [INSPIRE].
G. Aarts, F.A. James, E. Seiler and I.-O. Stamatescu, Complex Langevin: Etiology and Diagnostics of its Main Problem, Eur. Phys. J. C 71 (2011) 1756 [arXiv:1101.3270] [INSPIRE].
T. Hayata, Y. Hidaka and Y. Tanizaki, Complex saddle points and the sign problem in complex Langevin simulation, Nucl. Phys. B 911 (2016) 94 [arXiv:1511.02437] [INSPIRE].
K. Nagata, J. Nishimura and S. Shimasaki, Argument for justification of the complex Langevin method and the condition for correct convergence, Phys. Rev. D 94 (2016) 114515 [arXiv:1606.07627] [INSPIRE].
L.L. Salcedo, Does the complex Langevin method give unbiased results?, Phys. Rev. D 94 (2016) 114505 [arXiv:1611.06390] [INSPIRE].
AuroraScience collaboration, M. Cristoforetti, F. Di Renzo and L. Scorzato, New approach to the sign problem in quantum field theories: High density QCD on a Lefschetz thimble, Phys. Rev. D 86 (2012) 074506 [arXiv:1205.3996] [INSPIRE].
M. Cristoforetti, F. Di Renzo, A. Mukherjee and L. Scorzato, Monte Carlo simulations on the Lefschetz thimble: Taming the sign problem, Phys. Rev. D 88 (2013) 051501 [arXiv:1303.7204] [INSPIRE].
A. Mukherjee, M. Cristoforetti and L. Scorzato, Metropolis Monte Carlo integration on the Lefschetz thimble: Application to a one-plaquette model, Phys. Rev. D 88 (2013) 051502 [arXiv:1308.0233] [INSPIRE].
H. Fujii, D. Honda, M. Kato, Y. Kikukawa, S. Komatsu and T. Sano, Hybrid Monte Carlo on Lefschetz thimbles — A study of the residual sign problem, JHEP 10 (2013) 147 [arXiv:1309.4371] [INSPIRE].
M. Cristoforetti et al., An efficient method to compute the residual phase on a Lefschetz thimble, Phys. Rev. D 89 (2014) 114505 [arXiv:1403.5637] [INSPIRE].
A. Alexandru, G. Basar, P.F. Bedaque, G.W. Ridgway and N.C. Warrington, Sign problem and Monte Carlo calculations beyond Lefschetz thimbles, JHEP 05 (2016) 053 [arXiv:1512.08764] [INSPIRE].
M. Fukuma and N. Umeda, Parallel tempering algorithm for integration over Lefschetz thimbles, PTEP 2017 (2017) 073B01 [arXiv:1703.00861] [INSPIRE].
A. Alexandru, G. Basar, P.F. Bedaque and N.C. Warrington, Tempered transitions between thimbles, Phys. Rev. D 96 (2017) 034513 [arXiv:1703.02414] [INSPIRE].
J. Nishimura and S. Shimasaki, Combining the complex Langevin method and the generalized Lefschetz-thimble method, JHEP 06 (2017) 023 [arXiv:1703.09409] [INSPIRE].
Y. Mori, K. Kashiwa and A. Ohnishi, Toward solving the sign problem with path optimization method, arXiv:1705.05605 [INSPIRE].
M. Fukuma, S. Sugishita and Y. Sakatani, Propagators in de Sitter space, Phys. Rev. D 88 (2013) 024041 [arXiv:1301.7352] [INSPIRE].
Open Access
This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
ArXiv ePrint: 1705.06097
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Fukuma, M., Matsumoto, N. & Umeda, N. Distance between configurations in Markov chain Monte Carlo simulations. J. High Energ. Phys. 2017, 1 (2017). https://doi.org/10.1007/JHEP12(2017)001
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/JHEP12(2017)001