Data fusion and mis-information removal in social networks

A key issue in state estimation presented in a multiagent social network scenario is the inadvertent multiple re-use of data also known as mis-information propagation. We formulate this mis-information propagation in a graph theoretic setting and give a necessary and sufficient conditions on the adjacency matrix so that the underlying state can be estimated. A suboptimal algorithm is also presented when the information flow graph is not known.