Efficient and universal characterization of atomic structures through a topological graph order parameter

نویسندگان

چکیده

A new graph-based order parameter is introduced for the characterization of atomistic structures. The universal to any material/chemical system, and transferable all structural geometries. Three sets data are used validate both generalizability accuracy algorithm: (1) liquid lithium configurations spanning up 300 GPa, (2) condensed phases carbon along with nanotubes buckyballs at ambient high temperature, (3) a diverse set aluminum including surfaces, compressed expanded lattices, point defects, grain boundaries, liquids, nanoparticles, non-zero temperatures. also compared existing methods speed accuracy. Our uniquely classifies every configuration outperforms crystalline parameters studied here, opening door its use in multitude complex application spaces that can require fine configurational materials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a contrastive analysis of concord and head parameter in english and azerbaijani

این پایان نامه به بررسی و مقایسه دو موضوع مطابقه میان فعل و فاعل (از نظر شخص و مشار) و هسته عبارت در دو زبان انگلیسی و آذربایجانی می پردازد. اول رابطه دستوری مطابقه مورد بررسی قرار می گیرد. مطابقه به این معناست که فعل مفرد به همراه فاعل مفرد و فعل جمع به همراه فاعل جمع می آید. در انگلیسی تمام افعال، بجز فعل بودن (to be) از نظر شمار با فاعلشان فقط در سوم شخص مفرد و در زمان حال مطابقت نشان میدهند...

15 صفحه اول

Topological Characterization of Cyclic Structures

The sum of the topological distances in the molecular graph (the Wiener number) is used for a topological characterization of the condensed polycyclic molecular systems. This topological index discriminates well the isomeric cyclic molecules. In addition, it also properly reflects their structural features. On this basis the principal points of molecular cyclicity are formulated in 15 rules. La...

متن کامل

Distance-Based Topological Indices and Double graph

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

On universally efficient estimation of the first order autoregressive parameter and universal data compression

Absfrucf -A universal nearly efficient estimator is proposed for the first order autoregressive (AR) model where the probability distribution of the driving noise is unknown. The proposed estimator has an intuitively appealing relation to universal data compression and to universal tests for randomness. Index Terms -asymptotically efficient estimation, universal estimation, Cramer-Rao bound, Fi...

متن کامل

Classical mathematical structures within topological graph theory

Finite simple graphs are a playground for classical areas of mathematics. We illustrate this by looking at some results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: npj computational materials

سال: 2022

ISSN: ['2057-3960']

DOI: https://doi.org/10.1038/s41524-022-00717-7