RWE: A Random Walk Based Graph Entropy for the Structural Complexity of Directed Networks-Reference-Cited by-同舟云学术

RWE: A Random Walk Based Graph Entropy for the Structural Complexity of Directed Networks

Published:2024-03 Issue:2 Volume:11 Page:2264-2278
ISSN:2327-4697
Container-title:IEEE Transactions on Network Science and Engineering
language:
Short-container-title:IEEE Trans. Netw. Sci. Eng.

Author:

Zhang Chong¹^ORCID,Deng Cheng²^ORCID,Fu Luoyi²^ORCID,Wang Xinbing²^ORCID,Chen Guihai²^ORCID,Zhou Lei³^ORCID,Zhou Chenghu⁴^ORCID

Affiliation:

1. School of Computer Science and Technology, Xi'an Jiaotong University, Xi'an Shaanxi, China

2. School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong Univesity, Shanghai, China

3. School of Oceanography, Shanghai Jiao Tong University, Shanghai, China

4. State Key Laboratory of Resources and Environmental Information System, Institute of Geographical Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing, China

Funder

National Key R&D Program of China

National Natural Science Foundation of China

Shaanxi Province Key Industry Innovation Program

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Link

http://xplorestaging.ieee.org/ielx7/6488902/10443744/10381776.pdf?arnumber=10381776

Reference49 articles.

1. Quantitative Measures of Network Complexity

2. Structural Information and Dynamical Complexity of Networks

3. Life, information theory, and topology

4. Discrimination of isomeric structures using information theoretic topological indices

5. The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States

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

1. Node Embedding Accelerates Randoms Walk on a Graph;2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC);2024-07-02