二度序列递增的有向指数随机图模型的渐近性
Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
摘要:
虽然基于度序列的无向网络模型的渐近分析在最近的文献中已经开始出现,但研究有向网络模型的统计性质仍然是一个开放的问题。在本文中,我们首次提供了严格的分析,有向指数随机图模型使用的入度和出度的充分统计量与二进制以及连续加权边。当参数个数增加且只有一个图的可实现观测时,我们建立了最大似然估计的一致相合性和渐近正态性。证明中的一个关键技术是用一个简单的矩阵高精度地近似Fisher信息矩阵的逆。数值研究证实了我们的理论发现。
英文摘要:
Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we provide for the first time a rigorous analysis of directed exponential random graph models using the in-degrees and out-degrees as sufficient statistics with binary as well as continuous weighted edges. We establish the uniform consistency and the asymptotic normality for the maximum likelihood estimate, when the number of parameters grows and only one realized observation of the graph is available. One key technique in the proofs is to approximate the inverse of the Fisher information matrix using a simple matrix with high accuracy. Numerical studies confirm our theoretical findings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。