arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.00084stat.COcs.SIphysics.soc-ph
收藏

标号图计数的递归公式

Recursive Formula for Labeled Graph Enumeration

Ravi Goyal, Victor De Gruttola

摘要:

这份手稿提出了一个通用的递归公式来估计与代数映射相关的纤维的大小,从图到社会网络分析的重要性的汇总统计,如边数(图密度),度序列,度分布,节点协变量混合,度混合。也就是说,该公式估计具有给定网络属性值的标记图的数量。所提出的方法可以扩展到附加的网络属性(例如,聚类)以及二分网络的属性。对于存在替代公式的特殊设置,仿真研究证明了所提出的方法的有效性。我们说明了估计与Barabási-Albert模型相关的纤维尺寸的方法,用于度分布和度混合的性质。此外,我们演示了如何使用该方法来评估纤维内的图形的多样性。

英文摘要:

This manuscript presents a general recursive formula to estimate the size of fibers associated with algebraic maps from graphs to summary statistics of importance for social network analysis, such as number of edges (graph density), degree sequence, degree distribution, mixing by nodal covariates, and degree mixing. That is, the formula estimates the number of labeled graphs that have given values for network properties. The proposed approach can be extended to additional network properties (e.g., clustering) as well as properties of bipartite networks. For special settings in which alternative formulas exist, simulation studies demonstrate the validity of the proposed approach. We illustrate the approach for estimating the size of fibers associated with the Barabási--Albert model for the properties of degree distribution and degree mixing. In addition, we demonstrate how the approach can be used to assess the diversity of graphs within a fiber.

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

↑