59789

Автор(ов): 

2

Параметры публикации
Тип публикации: 
Доклад
Название: 
Leader Nodes in Communities for Information Spreading
ISBN/ISSN: 
978-3-030-66471-8
DOI: 
10.1007/978-3-030-66471-8_36
Наименование конференции: 
23rd International Conference «Distributed Computer and Communication Networks: Control, Computation, Communications» (DCCN-2020, Moscow)
Наименование источника: 
Proceedings of the 23st International Conference «Distributed Computer and Communication Networks: Control, Computation, Communications» (DCCN-2020, Moscow)
Обозначение и номер тома: 
LNCS 12563
Город: 
Schwitzerland, Cham
Издательство: 
Springer
Год издания: 
2020
Страницы: 
475-484
Аннотация
The paper is devoted to the effective information spreading in random complex networks. Our objective is to elect leader nodes or communities of the network, which may spread the content among all nodes faster. We consider a well-known SPREAD algorithm by Mosk- Aoyama and Shah (2006), which provides the spreading and the growth of the node set possessing the information. Assuming that all nodes have asynchronous clocks, the next node is chosen uniformly among nodes of the network by the global clock tick according to a Poisson process. The extremal index measures the clustering tendency of high threshold exceedances. The node extremal index shows the ability to attract highly ranked nodes in the node orbit. Considering a closeness centrality as a measure of a node’s leadership, we find the relation between its extremal index and the minimal spreading time.
Библиографическая ссылка: 
Маркович Н.М., Рыжов М.С. Leader Nodes in Communities for Information Spreading / Proceedings of the 23st International Conference «Distributed Computer and Communication Networks: Control, Computation, Communications» (DCCN-2020, Moscow). Schwitzerland, Cham: Springer, 2020. LNCS 12563. С. 475-484.