arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.06900cs.ITmath.ITphysics.data-an
收藏

具有异质传感器的图上的随机游动检测

Detecting random walks on graphs with heterogeneous sensors

Dragana Bajovic, José M. F. Moura, Dejan Vukobratovic

摘要:

我们考虑的问题,检测一个图上的随机游走,基于观察的图形节点。当被walk访问时,图中的每个节点都观察到一个均值升高的信号,我们假设不同节点之间的均值可能不同。在步行路径之外,以及在没有步行路径的情况下,节点仅测量噪声。假设内曼-皮尔逊设置,我们的目标是通过计算错误指数的概率错过,在虚警概率的约束下,检测性能的特征。由于精确计算的误差指数是已知的困难,相当于计算的李雅普诺夫指数,我们近似其值找到一个易于处理的下限。边界揭示了一个有趣的可检测性条件:步行是可检测的熵的步行是小于预期的信号噪声比的一半。我们通过将马尔可夫类型的概念扩展到高斯-马尔可夫类型来推导出边界。这些是具有给定数量的节点到节点转换计数和跨节点的相同平均信号值的状态观测对的序列,其根据随机游走访问每个节点的相应位置期间进行的测量来计算。下界有一个直观的解释:在所有高斯-马尔可夫类型中,在没有行走的情况下是渐近可行的,在行走的存在下,界找到最典型的一个。最后,我们通过一系列明智的问题重新表述,计算界减少到解决凸优化问题,这是一个结果本身。

英文摘要:

We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different nodes. Outside of the path of the walk, and also in its absence, nodes measure only noise. Assuming the Neyman-Pearson setting, our goal then is to characterize detection performance by computing the error exponent for the probability of a miss, under a constraint on the probability of false alarm. Since exact computation of the error exponent is known to be difficult, equivalent to computation of the Lyapunov exponent, we approximate its value by finding a tractable lower bound. The bound reveals an interesting detectability condition: the walk is detectable whenever the entropy of the walk is smaller than one half of the expected signal-to-noise ratio. We derive the bound by extending the notion of Markov types to Gauss-Markov types. These are sequences of state-observation pairs with a given number of node-to-node transition counts and the same average signal values across nodes, computed from the measurements made during the times the random walk was visiting each node's respective location. The lower bound has an intuitive interpretation: among all Gauss-Markov types that are asymptotically feasible in the absence of the walk, the bound finds the most typical one under the presence of the walk. Finally, we show by a sequence of judicious problem reformulations that computing the bound reduces to solving a convex optimization problem, which is a result in its own right.

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

↑