Encoding and Selecting Coarse-Grain Mapping Operators with Hierarchical Graphs

Abstract

Coarse grain (CG) molecular dynamics (MD) can simulate systems inaccessible to fine grain (FG) MD simulations. A CG simulation decreases the degrees of freedom by mapping atoms from an FG representation into agglomerate CG particles. The FG to CG mapping is not unique. Research into systematic selection of these mappings is challenging due to their combinatorial growth with respect to the number of atoms in a molecule. Here we present a method of reducing the total count of mappings by imposing molecular topology and symmetry constraints. The count reduction is illustrated by considering all mappings for nearly 49,889 molecules. The resulting number of mapping operators is still large, so we introduce hierarchical graphs which encode multiple CG mapping operators. The encoding method is demonstrated for methanol and a 14-mer peptide. This encoding provides a foundation to perform automated mapping selection.

arXiv comment14 pages, 5 figures

References in corpus (9)

• Interatomic potentials from first-principles calculations: the force-matching method
• The relation between Granger causality and directed information theory: a review
• DNA: From rigid base-pairs to semiflexible polymers
• Predictive Coarse-Graining
• Relation between Boltzmann and Gibbs entropy and example with multinomial distribution
• The different paths to entropy
• Equivalence among different formalisms in the Tsallis entropy framework
• Combining Enhanced Sampling with Experiment Directed Simulation of the GYG peptide
• Expressing the entropy of lattice systems as sums of conditional entropies

Cited by in corpus (4)

• Coarse-Graining Auto-Encoders for Molecular Dynamics
• Graph Neural Network Based Coarse-Grained Mapping Prediction
• Ensuring thermodynamic consistency with invertible coarse-graining
• Coarse-grained conformational surface hopping: Methodology and transferability