Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 40 min ago
PreprintarXiv licencearXiv

Permutationally Invariant Polynomial Descriptors as Colored Multigraphs

Abstract

The combinatorial explosion in monomial counts limits the extension of global permutationally invariant polynomial (PIP) potential energy surfaces to larger molecular systems. We use graph-theoretic language to reformulate PIPs as colored multigraphs and develop a series of theoretical and computational tools. First, we introduce an offline PIP generation algorithm whose cost has an upper bound independent of atom count for a fixed degree cutoff and number of element types. Second, we introduce a new online PIP evaluation algorithm, termed tensor-network descent. For the full PIP set through degree d in a system of M atoms, the evaluation complexity for 1≤ d≤14 is O (f(d)M⌊(√(1+8d)+1)/2⌋). At the commonly used cutoff of d=5, the online evaluation complexity decreases from the M10 scaling of conventional explicit term-by-term computation to M3. Numerical tests using the full PIP set through degree 5 show that our method achieves speedups of several orders of magnitude on most MD17 systems and remains computationally affordable for systems containing more than one thousand atoms. The method has a native tensor form, supports automatic differentiation, and provides a unified theoretical construction of four classes of PIP descriptors defined consistently across systems---global, atom-centered, bond-centered, and cluster-centered---establishing a representation and computational foundation for PIP potentials for large systems and for transfer across systems. Together, these results show that PIPs are neither inherently restricted to small systems nor intrinsically nontransferable.

Related

  1. Limits of geometric packing descriptors in molecular crystal energy ranking
    Pavlo Bondarenko
    ChemRxivPreprintLicence not statedGeneral chemistryChemRxiv
  2. A Machine Learning Approach to logBB Prediction Combining Molecular Docking and Quantum-Chemical Descriptors
    Lilian Rouille
    ChemRxivPreprintLicence not statedGeneral chemistryChemRxiv
  3. How Molecular Weight Shapes the Relative Importance of Chemical and Structural Descriptors for Aqueous Solubility
    Sampreeti Bhattacharya, Arkaprava Roy
    ChemRxivPreprintLicence not statedGeneral chemistryChemRxiv
  4. Same Raw Data, Different Numbers: Locked Analysis Rules Make Film Descriptors of Organic Semiconductors Reproducible
    Manmohan Dash, M. N. Satyanarayan
    ChemRxivPreprintLicence not statedGeneral chemistryChemRxiv
  5. Ensemble Molecular Surface Electrostatic Potential Descriptors as Informative Features for Active Learning
    Gian-Michele Cherchi, Tommaso Marchetti, Sijbren Otto +1
    ChemRxivPreprintLicence not statedGeneral chemistryChemRxiv
BibTeX
@misc{hao2026permutationally,
  title = {{Permutationally Invariant Polynomial Descriptors as Colored Multigraphs}},
  author = {Yiping Hao and Bina Fu and Dong H. Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.23034},
  eprint = {2610.23034},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.23034},
}
RIS
TY  - UNPB
TI  - Permutationally Invariant Polynomial Descriptors as Colored Multigraphs
AU  - Yiping Hao
AU  - Bina Fu
AU  - Dong H. Zhang
PY  - 2026
DA  - 2026/10/16
PB  - arXiv
DO  - 10.48550/arxiv.2610.23034
UR  - https://arxiv.org/abs/2610.23034
AB  - The combinatorial explosion in monomial counts limits the extension of global permutationally invariant polynomial (PIP) potential energy surfaces to larger molecular systems. We use graph-theoretic language to reformulate PIPs as colored multigraphs and develop a series of theoretical and computational tools. First, we introduce an offline PIP generation algorithm whose cost has an upper bound independent of atom count for a fixed degree cutoff and number of element types. Second, we introduce a new online PIP evaluation algorithm, termed tensor-network descent. For the full PIP set through degree d in a system of M atoms, the evaluation complexity for 1≤ d≤14 is O (f(d)M^⌊(√(1+8d)+1)/2⌋). At the commonly used cutoff of d=5, the online evaluation complexity decreases from the M^10 scaling of conventional explicit term-by-term computation to M^3. Numerical tests using the full PIP set through degree 5 show that our method achieves speedups of several orders of magnitude on most MD17 systems and remains computationally affordable for systems containing more than one thousand atoms. The method has a native tensor form, supports automatic differentiation, and provides a unified theoretical construction of four classes of PIP descriptors defined consistently across systems---global, atom-centered, bond-centered, and cluster-centered---establishing a representation and computational foundation for PIP potentials for large systems and for transfer across systems. Together, these results show that PIPs are neither inherently restricted to small systems nor intrinsically nontransferable.
ER  -