arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.26225math.STstat.TH
收藏

多重网络中的依赖关系:基于动机计数的方法

Dependencies in Multiplex Networks: A Motif Count Approach

EPFL(洛桑联邦理工学院)

Karl Sawaya, Sofia Olhede

AI总结:

本文提出基于动机计数的方法,用于估计和检验可交换多重网络中的依赖关系,通过扩展多层随机块模型网络直方图到任意动机计数,提供新的工具研究复杂网络中的高阶依赖。

摘要:

多重网络是一种强大的框架,用于表示具有多种相互作用的系统。理解其结构需要捕捉更高阶跨层相关性的统计工具。我们开发了一个全面的框架,通过动机计数来估计和检验可交换多重网络中的依赖关系。我们首先提出一种基于矩的估计方法,扩展多层随机块模型网络直方图到任意动机计数,这使得我们可以估计定义d层多重网络的2^d-1图核。然后我们推导了跨层动机计数的联合渐近分布,即跨层共享的对齐动机。扩展现有单层设置的结果,我们表明在动机规则情况下,极限分布表现出涉及图核之间最小距离的协方差结构。最后我们构建了假设检验来检测层间相似性和依赖性。这项工作为多重设置下的动机计数渐近性和推断程序提供了严格扩展,提供了研究复杂网络中高阶依赖的新工具。

英文摘要:

Multiplex networks are a powerful framework for representing systems with multiple types of interactions among a common set of entities. Understanding their structure requires statistical tools capturing higher-order cross-layer correlations. We develop a comprehensive framework for estimating and testing dependence in exchangeable multiplex networks through motif counts. We first propose a moment-based estimation methodology that extends the multi-layer stochastic block model network histogram to arbitrary motif counts. This allows us to estimate the $2^d-1$ graphons defining a $d$-layer multiplex network. We then derive the joint asymptotic distribution of cross-layer motif counts, that is aligned motifs shared across layers. Extending existing results from the unilayer setting, we show that the limiting distribution in the motif-regular case exhibits a covariance structure involving minimum-based distances between graphons. Finally, we construct hypothesis tests to detect inter-layer similarity and dependence. This work provides a rigorous extension of motif-count asymptotics and inference procedures to the multiplex setting, providing new tools to study high-order dependencies in complex networks.

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

↑