Efficient Estimation for Longitudinal Networks via Adaptive Merging
通过自适应合并实现纵向网络的高效估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要以纵向网络的时间边为研究对象,直接提出网络合并与网络参数估计方法。
通过自适应合并实现纵向网络的高效估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Longitudinal networks consist of sequences of temporal edges among multiple nodes, where the temporal edges are observed in real-time. They have become ubiquitous with the rise of online social platforms and e-commerce, but largely under-investigated in the literature. In this article, we propose an efficient estimation framework for longitudinal networks, leveraging strengths of adaptive network merging, tensor decomposition, and point processes. It merges neighboring sparse networks so as to enlarge the number of observed edges and reduce estimation variance, whereas the estimation bias introduced by network merging is controlled by exploiting local temporal structures for adaptive network neighborhood. A projected gradient descent algorithm is proposed to facilitate estimation, where the upper bound of the estimation error in each iteration is established. A thorough analysis is conducted to quantify the asymptotic behavior of the proposed method, which shows that it can significantly reduce the estimation error and also provides a guideline for network merging under various scenarios. We further demonstrate the advantage of the proposed method through extensive numerical experiments on synthetic datasets and a militarized interstate dispute dataset. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.