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

基于伪似然的具有依赖边和递增维度参数向量的随机图$M$-估计

Pseudo-likelihood-based $M$-estimation of random graphs with dependent edges and parameter vectors of increasing dimension

Florida State University(佛罗里达州立大学);Penn State University(宾夕法尼亚州立大学)

Jonathan R. Stewart, Michael Schweinberger

AI总结:

本文提出了一种基于伪似然的$M$-估计方法,用于估计具有依赖边和递增维度参数向量的随机图模型,通过分析相变和模型近退化对收敛速率的影响,展示了在密集和稀疏图设置中的应用。

摘要:

统计网络分析中的一个重要问题是如何在不可行的似然函数下估计离散和依赖网络数据的模型,而不牺牲计算可扩展性和统计保证。我们证明了通过建立伪似然基于$M$-估计量的收敛速率,可以实现具有依赖边的随机图模型的可扩展估计,特别是针对具有指数参数化和递增维度参数向量的离散无向图模型的单观测场景。我们强调了两个复杂现象对收敛速率的影响:相变和模型近退化。主要结果可能应用于离散和依赖网络、空间和时间数据。为了展示收敛速率,我们引入了一种新的广义$β$-模型,具有依赖边和递增维度参数向量,利用重叠子群体的额外结构来控制依赖。我们建立了广义$β$-模型在密集和稀疏图设置中的伪似然基于$M$-估计量的收敛速率。

英文摘要:

An important question in statistical network analysis is how to estimate models of discrete and dependent network data with intractable likelihood functions, without sacrificing computational scalability and statistical guarantees. We demonstrate that scalable estimation of random graph models with dependent edges is possible, by establishing convergence rates of pseudo-likelihood-based $M$-estimators for discrete undirected graphical models with exponential parameterizations and parameter vectors of increasing dimension in single-observation scenarios. We highlight the impact of two complex phenomena on the convergence rate: phase transitions and model near-degeneracy. The main results have possible applications to discrete and dependent network, spatial, and temporal data. To showcase convergence rates, we introduce a novel class of generalized $β$-models with dependent edges and parameter vectors of increasing dimension, which leverage additional structure in the form of overlapping subpopulations to control dependence. We establish convergence rates of pseudo-likelihood-based $M$-estimators for generalized $β$-models in dense- and sparse-graph settings.

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

↑