动态符号网络中平衡性的推断
Inference for Balance in Dynamic Signed Networks
AI总结:
针对动态符号网络,提出非参数推断方法估计指定时间点的结构平衡度,采用核平滑估计器利用时间平滑性,并基于Edgeworth展开建立高阶分布近似,理论证明时间平滑可降低稀疏网络中的观测噪声方差。
摘要:
符号网络由正负关系组成,结构平衡理论为理解其全局张力结构提供了重要的概念框架。现有统计方法主要关注评估单个观测网络中的平衡性经验证据,而许多现实世界的符号关系随时间演化。本文针对动态符号网络,在指定时间点对结构平衡的总体程度进行非参数推断,目标时间可能观测到也可能未观测到快照。我们考虑一个动态符号图模型,其中边的形成和符号的生成均由随时间平滑变化的图函数控制。为利用时间平滑性,我们构建了一个核平滑估计器,从目标时间点附近的快照中借用信息。我们的理论分析建立了一个学生化推断程序,并基于Edgeworth展开给出了高阶分布近似,表明时间平滑通过减少观测噪声的方差(直至平滑偏差和时间离散化误差)来改进稀疏网络中的推断。通过大量模拟研究和对政治科学中动态国际关系网络的应用,我们展示了所提方法的有限样本性能和实际效用。
英文摘要:
Signed networks consist of both positive and negative relations, and structural balance theory provides an important conceptural framework for understanding their global tension structure. While existing statistical methods mainly focus on assessing empirical evidence of balance in a single observed network, many real-world signed relations evolve over time. This paper develops nonparametric inference for the population degree of structural balance at specified time points in dynamic signed networks, where the target time may or may not coincide with an observed snapshot. We consider a dynamic signed graphon model in which both edge formation and sign generation are governed by smoothly time-varying graphon functions. To exploit temporal smoothness, we construct a kernel-smoothed estimator that borrows information from snapshots near the target time point. Our theoretical analysis establishes a studentized inference procedure and a higher-order distributional approximation based on Edgeworth expansion, showing that temporal smoothing improves inference in sparse networks by reducing variance of observation noise, up to smoothing bias and time-discretization errors. We demonstrate the finite-sample performance and practical usefulness of the proposed method through extensive simulation studies and an application to a dynamic international relation network in political science.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。