关于规则树中谣言源与其最佳估计之间的距离
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree
摘要：
本文讨论了谣言源识别问题，其目标是在网络中的一组给定的节点中找到谣言的起源节点。在本文中，我们专注于一个网络表示的正则树，没有任何循环，其中所有节点有相同数量的边连接到一个节点。对于这个网络，我们澄清，在相当高的概率下，源节点与最优估计器选择的节点之间的距离为3，其中距离是连接两个节点的唯一路径的边数。这通过原点和所选节点之间的距离的概率分布来阐明。
英文摘要：
This paper addresses the rumor source identification problem, where the goal is to find the origin node of a rumor in a network among a given set of nodes with the rumor. In this paper, we focus on a network represented by a regular tree which does not have any cycle and in which all nodes have the same number of edges connected to a node. For this network, we clarify that, with quite high probability, the origin node is within the distance 3 from the node selected by the optimal estimator, where the distance is the number of edges of the unique path connecting two nodes. This is clarified by the probability distribution of the distance between the origin and the selected node.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
