Suppr超能文献

有限连通无向图中的无限遍历随机游走

Infinite Ergodic Walks in Finite Connected Undirected Graphs.

作者信息

Volchenkov Dimitri

机构信息

Department of Mathematics and Statistics, Texas Tech University, 1108 Memorial Circle, Lubbock, TX 79409, USA.

出版信息

Entropy (Basel). 2021 Feb 8;23(2):205. doi: 10.3390/e23020205.

Abstract

The micro-canonical, canonical, and grand canonical ensembles of walks defined in finite connected undirected graphs are considered in the thermodynamic limit of . As infinitely long paths are extremely sensitive to structural irregularities and defects, their properties are used to describe the degree of structural imbalance, anisotropy, and navigability in finite graphs. For the first time, we introduce entropic force and pressure describing the effect of graph defects on mobility patterns associated with the very long walks in finite graphs; navigation in graphs and navigability to the nodes by the different types of ergodic walks; as well as node's fugacity in the course of prospective network expansion or shrinking.

摘要

在有限连通无向图中定义的游走的微正则、正则和巨正则系综在热力学极限下被考虑。由于无限长路径对结构不规则性和缺陷极其敏感,它们的性质被用于描述有限图中的结构不平衡、各向异性和可导航性程度。我们首次引入了熵力和压力,它们描述了图缺陷对与有限图中非常长的游走相关的移动模式的影响;图中的导航以及不同类型遍历游走到达节点的可导航性;以及在预期网络扩展或收缩过程中节点的逸度。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f088/7915167/4d68147b1d77/entropy-23-00205-g001.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验