谷歌浏览器插件
订阅小程序
在清言上使用

Supplementary Materials

semanticscholar(2019)

引用 0|浏览4
暂无评分
摘要
We recall here the entropy-like measure {S F } proposed in [1] and we compare it to our network entropy measure S. The results presented in [1] are substantially different from our achievements and the reason lies in the conceptual foundation of the two measures. We clarify their relation thank to a simple toy model. The “entropy of information flux distribution" {S F } is a single-node entropy measure, i.e. {S F } is a collection of entropy values, one for each node of the designed network (i = 1, ...N where N is the total number of nodes). This measure behaves similarly to the local disparity-heterogeneity index (or participation ratio PR) of weighted networks, and is defined as follows:
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要