Proc. of the 37th Symposium on Information Theory and its Applications
巻, 号, ページ
pp. 605-610
出版年月
2014年12月2日
出版者
和文:
英文:
会議名称
和文:
英文:
37th Symposium on Information Theory and its Applications
開催地
和文:
英文:
アブストラクト
This paper deals with the rumor source identification problem, where the goal is to find the origin node of a rumor among a given set of nodes with the rumor and its network. In this paper, we focus on a network represented by a regular tree which does not have any cycle, and all nodes have the same number of edges connected to a node. For this network, we clarify the probability distribution of the distance between the origin and the node selected by the optimal estimator, where the distance is given by the minimum number of edges of paths connecting them.
各種検索
サポート
ヘルプ