Topological energy of networks

Author:

Nie Chun-Xiao12ORCID

Affiliation:

1. School of Statistics and Mathematics, Zhejiang Gongshang University , Hangzhou 310018, China and , Hangzhou 310018, China

2. Collaborative Innovation Center of Statistical Data Engineering, Technology & Application, Zhejiang Gongshang University , Hangzhou 310018, China and , Hangzhou 310018, China

Abstract

Energy is an important network indicator defined by the eigenvalues of an adjacency matrix that includes the neighbor information for each node. This article expands the definition of network energy to include higher-order information between nodes. We use resistance distances to characterize the distances between nodes and order complexes to extract higher-order information. Topological energy ( T E), defined by the resistance distance and order complex, reveals the characteristics of the network structure from multiple scales. In particular, calculations show that the topological energy can be used to distinguish graphs with the same spectrum well. In addition, topological energy is robust, and small random perturbations of edges do not significantly affect the T E values. Finally, we find that the energy curve of the real network is significantly different from that of the random graph, thus showing that T E can be used to distinguish the network structure well. This study shows that T E is an indicator that distinguishes the structure of a network and has some potential applications for real-world problems.

Funder

the characteristic & preponderant discipline of key construction universities in Zhejiang province

Publisher

AIP Publishing

Subject

Applied Mathematics,General Physics and Astronomy,Mathematical Physics,Statistical and Nonlinear Physics

Reference40 articles.

1. Laplacian energy of a graph;Linear Algebra Appl.,2006

2. On distance energy of graphs;MATCH Commun. Math. Comput. Chem.,2008

3. The matching energy of a graph;Discrete Appl. Math.,2012

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Differentiate data by higher-order structures;Information Sciences;2024-01

2. Evolutionary dynamics of N-player sender-receiver game in networks with community structure;Chaos: An Interdisciplinary Journal of Nonlinear Science;2023-10-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3