Modeling aggregation processes of Lennard-Jones particles via stochastic networks

Abstract

We model an isothermal aggregation process of particles/atoms interacting according to the Lennard-Jones pair potential by mapping the energy landscapes of each cluster size $N$ onto stochastic networks, computing transition probabilities {from} the network for an $N$-particle cluster to the one for $N+1$, and connecting these networks into a single joint network. The attachment rate is a control parameter. The resulting network representing the aggregation of up to 14 particles contains {6427} vertices. It is not only time-irreversible but also reducible. To analyze its transient dynamics, we introduce the sequence of the expected initial and pre-attachment distributions and compute them for a wide range of attachment rates and three values of temperature. As a result, we find the {configurations most likely to be observed} in the process of aggregation for each cluster size. We examine the attachment process and conduct a structural analysis of the sets of local energy minima for every cluster size. We show that both processes taking place in the network, attachment and relaxation, lead to the dominance of icosahedral packing in small (up to 14 atom) clusters.

arXiv comment28 pages, 13 figures, 6 tables

References in corpus (10)

• Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
• String Method for the Study of Rare Events
• The double-funnel energy landscape of the 38-atom Lennard-Jones cluster
• Thermodynamics and the Global Optimization of Lennard-Jones clusters
• The Gentlest Ascent Dynamics
• A geometrical approach to computing free energy landscapes from short-ranged potentials
• Flows in Complex Networks: Theory, Algorithms, and Application to Lennard-Jones Cluster Rearrangement
• Simulating structural transitions by direct transition current sampling: the example of LJ38
• Sticky-sphere clusters
• Metastability, Spectra, and Eigencurrents of the Lennard-Jones-38 Network

Cited by in corpus (3)

• A Symmetry-orientated Divide-and-Conquer Method for Crystal Structure Prediction
• From Sticky-Hard-Sphere to Lennard-Jones-Type Clusters
• Testing Lennard-Jones Clusters for Optimality