Asymmetric information diffusion via gossiping on static and dynamic networks

@article{Yildiz2010AsymmetricID,
  title={Asymmetric information diffusion via gossiping on static and dynamic networks},
  author={Mehmet E. Yildiz and Anna Scaglione and Asuman E. Ozdaglar},
  journal={49th IEEE Conference on Decision and Control (CDC)},
  year={2010},
  pages={7467-7472}
}
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the network called destinations. This case generalizes the typical average consensus gossiping policy, where all nodes are both sources and destinations. We first describe prior results we obtained on a static network topology and gossip policy, high-lighting what conditions lead to the desired information flow. We show… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
12 Extracted Citations
13 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 12 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 13 references

Non-negative Matrices and Markov Chains

  • E. Seneta
  • Springer Series in Statistics,
  • 1981
Highly Influential
3 Excerpts

Computing aggregate information using gossip

  • D. Kempe, A. Dobra, J. Gehrke
  • Proc. Foundations of Computer Science, Cambridge…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…