arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.11074cs.ITmath.IT
收藏

有向信息图的测试

Testing for directed information graphs

Sina Molavipour, Germán Bassi, Mikael Skoglund

摘要:

在本文中,我们研究了一个假设检验,以确定在网络中的节点,其中的节点表示随机过程和链接的方向表示所述过程之间的因果关系的底层有向图结构。具体地说,一个k阶马尔可夫结构被认为是他们,和选择的度量,以确定节点之间的连接是有向信息。假设检验是基于经验计算的转移概率,用于估计有向信息。对于一个单一的边缘,它被证明是可以任意选择的检测概率接近1,而虚警概率仍然可以忽略不计。当测试是在整个图上进行,我们推导出的虚警和检测概率,这表明,通过适当地设置阈值测试和使用大量的样本的测试是渐近最优的界限。此外,我们研究了测度的收敛如何依赖于真实图中链接的存在。

英文摘要:

In this paper, we study a hypothesis test to determine the underlying directed graph structure of nodes in a network, where the nodes represent random processes and the direction of the links indicate a causal relationship between said processes. Specifically, a k-th order Markov structure is considered for them, and the chosen metric to determine a connection between nodes is the directed information. The hypothesis test is based on the empirically calculated transition probabilities which are used to estimate the directed information. For a single edge, it is proven that the detection probability can be chosen arbitrarily close to one, while the false alarm probability remains negligible. When the test is performed on the whole graph, we derive bounds for the false alarm and detection probabilities, which show that the test is asymptotically optimal by properly setting the threshold test and using a large number of samples. Furthermore, we study how the convergence of the measures relies on the existence of links in the true graph.

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

↑