Attractive versus truncated repulsive supercooled liquids: The dynamics is encoded in the pair correlation function
We compare glassy dynamics in two liquids that differ in the form of their interaction potentials. Both systems have the same repulsive interactions but one has also an attractive part in the potential. These two systems exhibit very different dynamics despite having nearly identical pair correlation functions. We demonstrate that a properly weighted integral of the pair correlation function, which amplifies the subtle differences between the two systems, correctly captures their dynamical differences. The weights are obtained from a standard machine learning algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Combining Machine Learning and Physics to Understand Glassy Systems
Our understanding of supercooled liquids and glasses has lagged significantly behind that of simple liquids and crystalline solids. This is in part due to the many possibly relevant degrees of freedom that are present du…
BIG-bench Machine LearningPhysical IntuitionPlanted vertex cover problem on regular random graphs and nonmonotonic temperature-dependence in the supercooled region
We introduce a planted vertex cover problem on regular random graphs and study it by the cavity method of statistical mechanics. Different from conventional Ising models, the equilibrium ferromagnetic phase transition of…
The Shape of Attraction in UMAP: Exploring the Embedding Forces in Dimensionality Reduction
Uniform manifold approximation and projection (UMAP) is among the most popular neighbor embedding methods. The method relies on attractive and repulsive forces among high-dimensional data points to obtain a low-dimension…
Dimensionality ReductionCollective Decision Making using Attractive and Repulsive Forces in Markovian Opinion Dynamics
In this paper, we model a decision-making process involving a set of interacting agents. We use Markovian opinion dynamics, where each agent switches between decisions according to a continuous time Markov chain. Existin…
Autonomous VehiclesDecision MakingTired of Over-smoothing? Stress Graph Drawing Is All You Need!
In designing and applying graph neural networks, we often fall into some optimization pitfalls, the most deceptive of which is that we can only build a deep model by solving over-smoothing. The fundamental reason is that…
All