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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 62; H. 5; S. 2080 - 2094
Hauptverfasser:	Keyou You, Tempo, Roberto, Li Qiu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!