α-separable graph Hamiltonian network: A robust model for learning particle interactions in lattice systems.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 39972905.
- Also identified by DOI 10.1103/PhysRevE.111.015309.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
We propose an α-separable graph Hamiltonian network (α-SGHN) that reveals complex interaction patterns between particles in lattice systems. Utilizing trajectory data, α-SGHN infers potential interactions without prior knowledge about particle coupling, overcoming the limitations of traditional graph neural networks that require predefined links. Furthermore, α-SGHN preserves all conservation laws during trajectory prediction. Experimental results demonstrate that our model, incorporating structural information, outperforms baseline models based on conventional neural networks in predicting lattice systems. We anticipate that the results presented will be applicable beyond the specific on-site and intersite interaction lattices studied, including the Frenkel-Kontorova model, the rotator lattice, and the Toda lattice.