Topological complexity of crystal structures: quantitative approach.

IF 1.8 4区 材料科学
Acta Crystallographica Section A Pub Date : 2012-05-01 Epub Date: 2012-04-17 DOI:10.1107/S0108767312012044
Sergey Krivovichev
{"title":"Topological complexity of crystal structures: quantitative approach.","authors":"Sergey Krivovichev","doi":"10.1107/S0108767312012044","DOIUrl":null,"url":null,"abstract":"<p><p>The topological complexity of a crystal structure can be quantitatively evaluated using complexity measures of its quotient graph, which is defined as a projection of a periodic network of atoms and bonds onto a finite graph. The Shannon information-based measures of complexity such as topological information content, I(G), and information content of the vertex-degree distribution of a quotient graph, I(vd), are shown to be efficient for comparison of the topological complexity of polymorphs and chemically related structures. The I(G) measure is sensitive to the symmetry of the structure, whereas the I(vd) measure better describes the complexity of the bonding network.</p>","PeriodicalId":7400,"journal":{"name":"Acta Crystallographica Section A","volume":"68 Pt 3","pages":"393-8"},"PeriodicalIF":1.8000,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1107/S0108767312012044","citationCount":"125","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Crystallographica Section A","FirstCategoryId":"88","ListUrlMain":"https://doi.org/10.1107/S0108767312012044","RegionNum":4,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2012/4/17 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 125

Abstract

The topological complexity of a crystal structure can be quantitatively evaluated using complexity measures of its quotient graph, which is defined as a projection of a periodic network of atoms and bonds onto a finite graph. The Shannon information-based measures of complexity such as topological information content, I(G), and information content of the vertex-degree distribution of a quotient graph, I(vd), are shown to be efficient for comparison of the topological complexity of polymorphs and chemically related structures. The I(G) measure is sensitive to the symmetry of the structure, whereas the I(vd) measure better describes the complexity of the bonding network.

晶体结构的拓扑复杂性:定量方法。
晶体结构的拓扑复杂性可以用其商图的复杂性度量来定量评估,商图被定义为原子和键的周期网络在有限图上的投影。基于Shannon信息的复杂性度量,如拓扑信息含量I(G)和商图顶点度分布的信息含量I(vd),被证明是比较多态和化学相关结构的拓扑复杂性的有效方法。I(G)测量对结构的对称性敏感,而I(vd)测量更能描述键合网络的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
11.10%
发文量
0
审稿时长
3 months
期刊介绍: Acta Crystallographica Section A: Foundations and Advances publishes articles reporting advances in the theory and practice of all areas of crystallography in the broadest sense. As well as traditional crystallography, this includes nanocrystals, metacrystals, amorphous materials, quasicrystals, synchrotron and XFEL studies, coherent scattering, diffraction imaging, time-resolved studies and the structure of strain and defects in materials. The journal has two parts, a rapid-publication Advances section and the traditional Foundations section. Articles for the Advances section are of particularly high value and impact. They receive expedited treatment and may be highlighted by an accompanying scientific commentary article and a press release. Further details are given in the November 2013 Editorial. The central themes of the journal are, on the one hand, experimental and theoretical studies of the properties and arrangements of atoms, ions and molecules in condensed matter, periodic, quasiperiodic or amorphous, ideal or real, and, on the other, the theoretical and experimental aspects of the various methods to determine these properties and arrangements.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信