arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.06143eess.SPcs.ITmath.ITstat.AP
收藏

网络动态事件的快速检测

Quickest Detection of Dynamic Events in Networks

Shaofeng Zou, Venugopal V. Veeravalli, Jian Li, Don Towsley

摘要:

研究了网络中动态事件的快速检测问题。在某个未知的时间,一个事件发生,网络中的许多节点受到该事件的影响,因为它们的观测统计数据发生了变化。假设事件是动态的,因为它可以沿着网络中的边缘传播,并且随着时间的推移影响越来越多的节点。假设事件传播动力学是未知的。我们的目标是设计一个顺序算法,可以检测到一个“重大”事件,即,当事件影响不少于$η$节点时,尽可能快,同时控制虚警率。首先研究了全连通网络,然后将结果推广到任意连通网络。所设计的算法被证明是自适应的未知的传播动力学,和他们的一阶渐近最优证明的虚警率为零。该算法可以在每个时间步的网络规模上以线性计算复杂度实现,这对于在线实现至关重要。数值模拟验证了理论结果。

英文摘要:

The problem of quickest detection of dynamic events in networks is studied. At some unknown time, an event occurs, and a number of nodes in the network are affected by the event, in that they undergo a change in the statistics of their observations. It is assumed that the event is dynamic, in that it can propagate along the edges in the network, and affect more and more nodes with time. The event propagation dynamics is assumed to be unknown. The goal is to design a sequential algorithm that can detect a "significant" event, i.e., when the event has affected no fewer than $η$ nodes, as quickly as possible, while controlling the false alarm rate. Fully connected networks are studied first, and the results are then extended to arbitrarily connected networks. The designed algorithms are shown to be adaptive to the unknown propagation dynamics, and their first-order asymptotic optimality is demonstrated as the false alarm rate goes to zero. The algorithms can be implemented with linear computational complexity in the network size at each time step, which is critical for online implementation. Numerical simulations are provided to validate the theoretical results.

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

↑