Pith. sign in

REVIEW

Encoding and Selecting Coarse-Grain Mapping Operators with Hierarchical Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.04997 v1 pith:6GZTUEAR submitted 2018-04-13 physics.chem-ph

Encoding and Selecting Coarse-Grain Mapping Operators with Hierarchical Graphs

classification physics.chem-ph
keywords mappingencodingmappingsoperatorsatomscountgraingraphs
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.