Asymmetric information diffusion via gossiping on static and dynamic networks

Mehmet Ercan Yildiz, Anna Scaglione, Asuman Ozdaglar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

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, highlighting what conditions lead to the desired information flow. We show that, through semi-directed flows, this formulation allows to solve the problem with lower complexity than using plain gossiping policies. Inspired by these results, we move on to design algorithms to solve the problem in the dynamic case. For the dynamic network scenario we derive conditions under which the network converges to the desired result in the limit. We also provide policies that trade-off accuracy with increased mixing speed for the dynamic asymmetric diffusion problem.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Pages7467-7472
Number of pages6
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, GA, United States
Duration: Dec 15 2010Dec 17 2010

Other

Other2010 49th IEEE Conference on Decision and Control, CDC 2010
CountryUnited States
CityAtlanta, GA
Period12/15/1012/17/10

Fingerprint

Information Diffusion
Gossiping
Asymmetric Information
Dynamic Networks
Vertex of a graph
Gossip
Subset
Diffusion Problem
Algorithm Design
Information Flow
Topology
Network Topology
Low Complexity
Trade-offs
Converge
Scenarios
Generalise
Policy
Formulation

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Ercan Yildiz, M., Scaglione, A., & Ozdaglar, A. (2010). Asymmetric information diffusion via gossiping on static and dynamic networks. In Proceedings of the IEEE Conference on Decision and Control (pp. 7467-7472). [5717918] https://doi.org/10.1109/CDC.2010.5717918

Asymmetric information diffusion via gossiping on static and dynamic networks. / Ercan Yildiz, Mehmet; Scaglione, Anna; Ozdaglar, Asuman.

Proceedings of the IEEE Conference on Decision and Control. 2010. p. 7467-7472 5717918.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ercan Yildiz, M, Scaglione, A & Ozdaglar, A 2010, Asymmetric information diffusion via gossiping on static and dynamic networks. in Proceedings of the IEEE Conference on Decision and Control., 5717918, pp. 7467-7472, 2010 49th IEEE Conference on Decision and Control, CDC 2010, Atlanta, GA, United States, 12/15/10. https://doi.org/10.1109/CDC.2010.5717918
Ercan Yildiz M, Scaglione A, Ozdaglar A. Asymmetric information diffusion via gossiping on static and dynamic networks. In Proceedings of the IEEE Conference on Decision and Control. 2010. p. 7467-7472. 5717918 https://doi.org/10.1109/CDC.2010.5717918
Ercan Yildiz, Mehmet ; Scaglione, Anna ; Ozdaglar, Asuman. / Asymmetric information diffusion via gossiping on static and dynamic networks. Proceedings of the IEEE Conference on Decision and Control. 2010. pp. 7467-7472
@inproceedings{d15db678a6df4c5bbc22cef8c434a3f3,
title = "Asymmetric information diffusion via gossiping on static and dynamic networks",
abstract = "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, highlighting what conditions lead to the desired information flow. We show that, through semi-directed flows, this formulation allows to solve the problem with lower complexity than using plain gossiping policies. Inspired by these results, we move on to design algorithms to solve the problem in the dynamic case. For the dynamic network scenario we derive conditions under which the network converges to the desired result in the limit. We also provide policies that trade-off accuracy with increased mixing speed for the dynamic asymmetric diffusion problem.",
author = "{Ercan Yildiz}, Mehmet and Anna Scaglione and Asuman Ozdaglar",
year = "2010",
doi = "10.1109/CDC.2010.5717918",
language = "English (US)",
isbn = "9781424477456",
pages = "7467--7472",
booktitle = "Proceedings of the IEEE Conference on Decision and Control",

}

TY - GEN

T1 - Asymmetric information diffusion via gossiping on static and dynamic networks

AU - Ercan Yildiz, Mehmet

AU - Scaglione, Anna

AU - Ozdaglar, Asuman

PY - 2010

Y1 - 2010

N2 - 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, highlighting what conditions lead to the desired information flow. We show that, through semi-directed flows, this formulation allows to solve the problem with lower complexity than using plain gossiping policies. Inspired by these results, we move on to design algorithms to solve the problem in the dynamic case. For the dynamic network scenario we derive conditions under which the network converges to the desired result in the limit. We also provide policies that trade-off accuracy with increased mixing speed for the dynamic asymmetric diffusion problem.

AB - 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, highlighting what conditions lead to the desired information flow. We show that, through semi-directed flows, this formulation allows to solve the problem with lower complexity than using plain gossiping policies. Inspired by these results, we move on to design algorithms to solve the problem in the dynamic case. For the dynamic network scenario we derive conditions under which the network converges to the desired result in the limit. We also provide policies that trade-off accuracy with increased mixing speed for the dynamic asymmetric diffusion problem.

UR - http://www.scopus.com/inward/record.url?scp=79953142109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953142109&partnerID=8YFLogxK

U2 - 10.1109/CDC.2010.5717918

DO - 10.1109/CDC.2010.5717918

M3 - Conference contribution

SN - 9781424477456

SP - 7467

EP - 7472

BT - Proceedings of the IEEE Conference on Decision and Control

ER -