arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0912.4450cond-mat.dis-nn
收藏

网络中的量化结构

Quantifying structure in networks

Eckehard Olbrich, Thomas Kahle, Nils Bertschinger, Nihat Ay, Juergen Jost

摘要:

我们调查指数家庭的随机图分布作为一个框架,系统量化的网络结构。在本文中,我们限制自己的无向无标号图。对于这些图,不超过k个链接的子图的计数是最多k个链接之间相互作用的指数图族的充分统计量。在这个框架中,我们研究了几个通常用于量化网络结构的可观测量之间的依赖关系,如度分布,聚类和重复性系数。

英文摘要:

We investigate exponential families of random graph distributions as a framework for systematic quantification of structure in networks. In this paper we restrict ourselves to undirected unlabeled graphs. For these graphs, the counts of subgraphs with no more than k links are a sufficient statistics for the exponential families of graphs with interactions between at most k links. In this framework we investigate the dependencies between several observables commonly used to quantify structure in networks, such as the degree distribution, cluster and assortativity coefficients.

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

↑