arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.3645cond-mat.dis-nn
收藏

具有广义度约束的随机图系综的熵

Entropy of random graph ensembles constrained with generalised degrees

Ekaterina S. Roberts, Anthonius C. C. Coolen

摘要:

广义度在网络的局部和全局拓扑性质之间提供了一个自然的桥梁。我们将广义度定义为一步和两步内节点的邻居数。定制的随机图集成被用来量化和比较网络的拓扑性质,在一个系统和精确的方式,使用信息论的概念。我们计算的香农熵的随机图系综约束一个指定的广义度分布。我们发现,结果有一个自然的连接度度的相关性,这是隐含的指定一个广义度分布。我们演示了如何广义度可以用来定性和定量地描述一个网络。

英文摘要:

Generalised degrees provide a natural bridge between local and global topological properties of networks. We define the generalised degree to be the number of neighbours of a node within one and two steps respectively. Tailored random graph ensembles are used to quantify and compare topological properties of networks in a systematic and precise manner, using concepts from information theory. We calculate the Shannon entropy of random graph ensembles constrained with a specified generalised degree distribution. We find that the outcome has a natural connection with the degree-degree correlation which is implied by specifying a generalised degree distribution. We demonstrate how generalised degrees can be used to qualitatively and quantitatively describe a network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑