基于信息级联的切换动态网络拓扑跟踪
Tracking Switched Dynamic Network Topologies from Information Cascades
摘要:
流行新闻故事或传染病的传播等传染病在具有不可观测拓扑结构的动态网络上级联传播。然而,诸如产品购买时间或博客条目时间戳之类的“社交信号”是可测量的,并且隐式地依赖于底层拓扑,从而可以随着时间的推移对其进行跟踪。有趣的是,网络拓扑结构经常在离散状态之间“跳跃”,这可能是观测信号突然变化的原因。本文提出了一种切换动态结构方程模型来捕捉拓扑依赖的级联演化,以及驱动底层拓扑的离散状态。条件下,建议的切换模型是可识别的。利用社交网络固有的边缘稀疏性,提出了一种递归的$\ell_1$范数正则化最小二乘估计器来联合跟踪状态和网络拓扑.一个有效的一阶近似梯度算法来解决由此产生的优化问题。在一年的时间内,对合成数据和实际叶栅测量数据进行了数值试验,试验结果证实了所提出方法的有效性。
英文摘要:
Contagions such as the spread of popular news stories, or infectious diseases, propagate in cascades over dynamic networks with unobservable topologies. However, "social signals" such as product purchase time, or blog entry timestamps are measurable, and implicitly depend on the underlying topology, making it possible to track it over time. Interestingly, network topologies often "jump" between discrete states that may account for sudden changes in the observed signals. The present paper advocates a switched dynamic structural equation model to capture the topology-dependent cascade evolution, as well as the discrete states driving the underlying topologies. Conditions under which the proposed switched model is identifiable are established. Leveraging the edge sparsity inherent to social networks, a recursive $\ell_1$-norm regularized least-squares estimator is put forth to jointly track the states and network topologies. An efficient first-order proximal-gradient algorithm is developed to solve the resulting optimization problem. Numerical experiments on both synthetic data and real cascades measured over the span of one year are conducted, and test results corroborate the efficacy of the advocated approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。