Clique Gossiping

doi:10.1109/TNET.2019.2952082

	Clique Gossiping
	Liu, Yang 3; Li, Bo 4; Anderson, Brian D. O.1,3; Shi, Guodong 2,3
刊名	IEEE-ACM TRANSACTIONS ON NETWORKING
	2019-12-01
卷号	27 期号:6 页码:2418-2431
关键词	Gossip protocols cliques scheduling averaging algorithms
ISSN号	1063-6692
DOI	10.1109/TNET.2019.2952082
英文摘要	This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques. Clique-gossip protocols are defined as arbitrary linear node interactions where node states are vectors evolving as linear dynamical systems. Such protocols become clique-gossip averaging algorithms when node states are scalars under averaging rules. We generalize the classical notion of line graph to capture the essential node interaction structure induced by both the underlying network and the specific clique sequence. We prove a fundamental eigenvalue invariance principle for periodic clique-gossip protocols, which implies that any permutation of the clique sequence leads to the same spectrum for the overall state transition when the generalized line graph contains no cycle. We also prove that for a network with $n$ nodes, cliques with smaller sizes determined by factors of $n$ can always be constructed leading to finite-time convergent clique-gossip averaging algorithms, provided $n$ is not a prime number. Particularly, such finite-time convergence can be achieved with cliques of equal size $m$ if and only if $n$ is divisible by $m$ and they have exactly the same prime factors. A proven fastest finite-time convergent clique-gossip algorithm is constructed for clique-gossiping using size- $m$ cliques. Additionally, the acceleration effects of clique-gossiping are illustrated via numerical examples.
资助项目	Australian Research Council (ARC)[DP190103615] ; National Natural Science Foundation of China (NSFC)[61873262]
WOS研究方向	Computer Science ; Engineering ; Telecommunications
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000505578800018
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/50445]
专题	中国科学院数学与系统科学研究院
通讯作者	Shi, Guodong
作者单位	1.Hangzhou Dianzi Univ, Hangzhou 310018, Zhejiang, Peoples R China 2.Univ Sydney, Australian Ctr Field Robot, Sch Aerosp Mech & Mechatron Engn, Sydney, NSW 2006, Australia 3.Australian Natl Univ, Res Sch Elect Energy & Mat Engn, Canberra, ACT 0200, Australia 4.Chinese Acad Sci, Acad Math & Syst Sci, KLMM, Beijing 100190, Peoples R China
推荐引用方式 GB/T 7714	Liu, Yang,Li, Bo,Anderson, Brian D. O.,et al. Clique Gossiping[J]. IEEE-ACM TRANSACTIONS ON NETWORKING,2019,27(6):2418-2431.
APA	Liu, Yang,Li, Bo,Anderson, Brian D. O.,&Shi, Guodong.(2019).Clique Gossiping.IEEE-ACM TRANSACTIONS ON NETWORKING,27(6),2418-2431.
MLA	Liu, Yang,et al."Clique Gossiping".IEEE-ACM TRANSACTIONS ON NETWORKING 27.6(2019):2418-2431.