Convergence time evaluation of a gossip algorithm over signed graphs

Nguyen Thi Hoai Linh, Takayuki Wada, Izumi Masubuchi, Toru Asai, Yasumasa Fujisaki

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

Convergence time is investigated for a gossip algorithm over a connected signed graph, where each edge of the graph has positive or negative sign. The algorithm is an iterative procedure. At each time, (i) two nodes directly connected with an edge are chosen randomly, (ii) they exchange their values according to the sign of the edge, and (iii) they update their values as the average of each node's value and its received value. It is shown that the values of the algorithm always converge in mean square, where a bipartite consensus or a trivial consensus is achieved. A convergence time is defined as the smallest time such that it takes for the values of the algorithm to get within a given neighborhood of the consensus value with high probability, regardless of initial state. An upper bound of the convergence time is given in terms of a characteristic value of the given graph.

本文言語英語
ホスト出版物のタイトル2015 10th Asian Control Conference
ホスト出版物のサブタイトルEmerging Control Techniques for a Sustainable World, ASCC 2015
編集者Hazlina Selamat, Hafiz Rashidi Haruna Ramli, Ahmad Athif Mohd Faudzi, Ribhan Zafira Abdul Rahman, Asnor Juraiza Ishak, Azura Che Soh, Siti Anom Ahmad
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781479978625
DOI
出版ステータス出版済み - 9 8 2015
外部発表はい
イベント10th Asian Control Conference, ASCC 2015 - Kota Kinabalu, マレーシア
継続期間: 5 31 20156 3 2015

出版物シリーズ

名前2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015

その他

その他10th Asian Control Conference, ASCC 2015
Countryマレーシア
CityKota Kinabalu
Period5/31/156/3/15

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

引用スタイル