mlsanityData to 7 Oct 2026

Enhanced sampling of Crystal Nucleation with Graph Representation Learnt Variables

arXiv 2310.07927 ↗First posted 11 Oct 2023cond-mat.stat-mech cond-mat.mtrl-sci cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

In this study, we present a graph neural network-based learning approach using an autoencoder setup to derive low-dimensional variables from features observed in experimental crystal structures. These variables are then biased in enhanced sampling to observe state-to-state transitions and reliable thermodynamic weights. Our approach uses simple convolution and pooling methods. To verify the effectiveness of our protocol, we examined the nucleation of various allotropes and polymorphs of iron and glycine from their molten states. Our graph latent variables when biased in well-tempered metadynamics consistently show transitions between states and achieve accurate free energy calculations in agreement with experiments, both of which are indicators of dependable sampling. This underscores the strength and promise of our graph neural net variables for improved sampling. The protocol shown here should be applicable for other systems and with other sampling methods.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 84 references that are in the map. First posted on arXiv 11 Oct 2023.

Builds on

7 of 84 references.

References · 7

  1. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  2. 2017SchNet: A continuous-filter convolutional neural network for modeling quantum interactionscited by 569
  3. 2016Dynamic Filter Networkscited by 318
  4. 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 307
  5. 2019Machine learning for molecular simulationcited by 109
  6. 2018Neural Message Passing with Edge Updates for Predicting Properties of Molecules and Materialscited by 21
  7. 2023Enhanced Sampling with Machine Learning: A Reviewcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.