Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918044332195840 |
|---|---|
| author | Kowaguchi, Akie Endo, Katsuhiro Nomura, Kentaro Kurabayashi, Shuichi Brumby, Paul E. Yasuoka, Kenji |
| author_facet | Kowaguchi, Akie Endo, Katsuhiro Nomura, Kentaro Kurabayashi, Shuichi Brumby, Paul E. Yasuoka, Kenji |
| contents | The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we propose a new optimization scheme based on the Dijkstra algorithm that constructs an optimal exchange path by representing replicas and their exchange probabilities as a graph. Inspired by path-finding techniques widely used in computer science, including applications in game algorithms, our approach ensures that transitions follow a minimum entropy gradient path and effectively speeds up sampling even in systems exhibiting slow relaxation near critical points or phase transition regions. The method provides a systematic way to improve replica exchange efficiency and offers new insights into the control of relaxation dynamics, as demonstrated through applications to the solid-liquid phase transition of the Lennard-Jones bulk system. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_02549 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo Kowaguchi, Akie Endo, Katsuhiro Nomura, Kentaro Kurabayashi, Shuichi Brumby, Paul E. Yasuoka, Kenji Statistical Mechanics Computational Physics The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we propose a new optimization scheme based on the Dijkstra algorithm that constructs an optimal exchange path by representing replicas and their exchange probabilities as a graph. Inspired by path-finding techniques widely used in computer science, including applications in game algorithms, our approach ensures that transitions follow a minimum entropy gradient path and effectively speeds up sampling even in systems exhibiting slow relaxation near critical points or phase transition regions. The method provides a systematic way to improve replica exchange efficiency and offers new insights into the control of relaxation dynamics, as demonstrated through applications to the solid-liquid phase transition of the Lennard-Jones bulk system. |
| title | Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo |
| topic | Statistical Mechanics Computational Physics |
| url | https://arxiv.org/abs/2506.02549 |