.png){kind=icon}
返回
Information processing in complex networks: Graph entropy and information functionals
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.12.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a general framework for de. ning the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the topological structure of a given graph. More precisely, an information functional quantifies structural information of a graph based on a derived probability distribution. Such a probability distribution leads directly to an entropy of a graph. Then, the structural information content of a graph will be is interpreted and defined as the derived graph entropy. Another major contribution of this paper is the investigation of relationships between graph entropies. In addition to this, we provide numerical results demonstrating not only the feasibility of our method, which has polynomial time complexity, but also its usefulness with regard to practical applications aiming to an understanding of information processing in complex networks. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
graphs
structural information content
graph entropy
information theory
applied graph theory
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
Autocrine TGFβ Is a Survival Factor for Monocytes and Drives Immunosuppressive Lineage Commitment
OAAI
OAAI分享收藏A Phase II Safety and Efficacy Study of the Vascular Endothelial Growth Factor Receptor Tyrosine Kinase Inhibitor Pazopanib in Patients With Metastatic Urothelial Cancer血管内皮生长因子受体酪氨酸激酶抑制剂帕唑帕尼治疗转移性尿路上皮癌的II期安全性和有效性研究OAAI
OAAI分享收藏Minding morphology: How morphological awareness relates to reading for English language learners
PREAI
分享收藏
查看更多内容