Distributed Algorithms for Computation of Centrality Measures in Complex Networks

This paper is concerned with distributed computation of several commonly used centrality measures in complex networks. In particular, we propose deterministic algorithms, which converge in finite time, for the distributed computation of the degree, closeness and betweenness centrality measures in di...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 62; no. 5; pp. 2080 - 2094
Main Authors:	Keyou You, Tempo, Roberto, Li Qiu
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Atmospheric measurements Centrality measures Complex networks Complex systems Convergence convergence properties Distributed algorithms distributed computation Eigenvectors Graph theory Graphs Internet Networks randomized algorithms Search algorithms Spamming Unsolicited electronic mail
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!