PhD2019 Proposal

From Werner KRAUTH

(Difference between revisions)
Jump to: navigation, search
Revision as of 18:25, 2 February 2019
Werner (Talk | contribs)

← Previous diff
Revision as of 18:26, 2 February 2019
Werner (Talk | contribs)

Next diff →
Line 30: Line 30:
[[Kapfer Krauth 2017|Kapfer and Krauth 2017]], [[Lei Krauth 2018|Lei and Krauth 2018]], but also on [[Lei Krauth 2018|mathematical proofs]]. [[Kapfer Krauth 2017|Kapfer and Krauth 2017]], [[Lei Krauth 2018|Lei and Krauth 2018]], but also on [[Lei Krauth 2018|mathematical proofs]].
-Important physical results were obtained for [[Bernard Krauth 2011|hard-sphere] and [[Kapfer Krauth 2014| general soft-sphere]] two-dimensional particle +Important physical results were obtained for [[Bernard Krauth 2011|hard-sphere]] and [[Kapfer Krauth 2014| general soft-sphere]] two-dimensional particle
-systems \cite{Bernard2011,Kapfer2015PRL}. Furthermore, we showed for continuous +systems. Furthermore, we showed for continuous
spin systems that the spin systems that the
Beyond-Metropolis algorithm reduces the dynamical critical exponent which Beyond-Metropolis algorithm reduces the dynamical critical exponent which

Revision as of 18:26, 2 February 2019

Beyond-Metropolis Markov chains: From the foundations to applications in soft-matter statistical physics, quantum computation, and data science

Projet de thèse soumis à doctorale EDPIF (PhD project submitted to the EDPIF doctoral school)

PhD advisor: Werner Krauth (please contact me if you are interested).

Location: Ecole normale supérieure, Laboratoire de Physique de l'ENS - UMR 8023

Note: The PhD candidate must either provide his/her own grant or apply for funding through the EDPIF doctoral school. Deadline for this application is 30 April 2019. There will be an audition of the candiates at the beginning of June 2019. Results will be known on 7 June 2019.

Summary of thesis project

The Markov-chain Monte Carlo method is an outstanding computational tool in science. Since its beginning, it has relied on the detailed-balance condition and the Metropolis algorithm to solve general computational problems under the conditions of thermodynamic equilibrium with zero probability flows. Nevertheless, the Metropolis algorithm is slow to reach equilibrium, as the detailed balance generically induces diffusive dynamics.

In recent years, the Monte Carlo framework has been generalized by our research group into irreversible ('Beyond Metropolis') Markov-chain algorithms (notably the event-chain algorithm) that violate detailed balance yet satisfy global balance. Equilibrium is reached as a steady state with non-vanishing probability flows. The famous Metropolis acceptance criterion based on the change in the energy is replaced by a consensus rule. Our research group has since 2015 validated the new paradigm in concrete applications and has in particular demonstrated that the modified Monte Carlo dynamics is fast and that it converges to the thermodynamic equilibrium notwithstanding the finite probability flows. Results obtained rely on extensive numerical calculations (see papers Nishikawa et al Kapfer and Krauth 2017, Lei and Krauth 2018, but also on mathematical proofs.

Important physical results were obtained for hard-sphere and general soft-sphere two-dimensional particle systems. Furthermore, we showed for continuous spin systems that the Beyond-Metropolis algorithm reduces the dynamical critical exponent which quantifies the equilibration process. This indicates that the gain in algorithmic speed can become infinite for large system size. Applications in particle systems have also been very successful, allowing to treat even the case of long-range interactions. A major development effort for a Python package using Beyond-Metropolis simulations for soft-matter systems is under way.

The goal of the PhD thesis project is to develop the foundations and the applications of the Beyond Metropolis framework in physics and the neighboring sciences. The project will be developed along (a subset of) the following directions:

  • Work on the foundations of the Beyond-Metropolis framework will address algorithmic challenges: How to overcome, categorize, and improve the factorization condition of the system potential and the restriction to infinitesimal moves? How to allow for extended or composite particles (or spins) with internal degrees of freedom? How to establish more mathematical proofs of mixing times? How to evolve the event-chain algorithm? How to understand its recent extensions in quantum field theory? How to extend the recent proofs of mixing times into rigorous statements on the physical phases?
  • Work on physical applications will consist, on the one hand in the development of our 'JellyFysh' simulation package (written in object-oriented Python3) and on the other hand in its applications, following recent work, to short-ranged interacting polymers and solvated peptides in water, among others.
  • Work on the extensions will concentrate on the application of the generalized Metropolis algorithm and its close relative, the heat bath algorithm (or Gibbs sampler) in the field of quantum computing. In addition, Markov-chain Monte Carlo methods are also of great importance in the field of data science and machine

The candidate for this PhD project will be a theoretical physicist with excellent mastery of classical and quantum statistical mechanics, experience with applied mathematics and command of computational physics, with a firm grip on programming in Python (or a willingness to learn).

Personal tools