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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on automatic control Ročník 62; číslo 5; s. 2080 - 2094
Hlavní autoři:	Keyou You, Tempo, Roberto, Li Qiu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.05.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!