Logo Logo
Switch Language to German

Frey, Christian; Zufle, Andreas; Emrich, Tobias and Renz, Matthias (2018): Efficient Information Flow Maximization in Probabilistic Graphs. In: IEEE Transactions on Knowledge and Data Engineering, Vol. 30, No. 5: pp. 880-894

Full text not available from 'Open Access LMU'.


Reliable propagation of information through large networks, e.g., communication networks, social networks, or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks. However, social ties of friendship may be obsolete, and communication links may fail, inducing the notion of uncertainty in such networks. In this paper, we address the problem of optimizing information propagation in uncertain networks given a constrained budget of edges. We show that this problem requires to solve two NP-hard subproblems: the computation of expected information flow, and the optimal choice of edges. To compute the expected information flow to a source vertex, we propose the F-tree as a specialized data structure, that identifies independent components of the graph for which the information flow can either be computed analytically and efficiently, or for which traditional Monte-Carlo sampling can be applied independently of the remaining network. For the problem of finding the optimal edges, we propose a series of heuristics that exploit properties of this data structure. Our evaluation shows that these heuristics lead to high quality solutions, thus yielding high information flow, while maintaining low running time.

Actions (login required)

View Item View Item