53081

Автор(ы): 
Маркович Н. М. (ИПУ РАН, Лаборатория 38)
Автор(ов): 

2

Параметры публикации
Тип публикации: 
Доклад
Название: 
Random graph node classification by extremal index of PageRank
ISBN/ISSN: 
978-5-209-09683-2
Наименование конференции: 
22nd International Scientific Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)
Наименование источника: 
Proceedings of the 22nd International Scientific Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)
Город: 
Moscow
Издательство: 
РУДН
Год издания: 
2019
Страницы: 
313-320
Аннотация
Taking account for the graph randomness, our purpose is a node classification by their extremal indexes (EI) as the local dependence measure of node influence characteristics. The EI was calculated by node PageRanks of the local tree related to the node, which is a kind of Thorny Branching Tree (TBT). The blocks estimator was used for the EI estimation by sliding and disjoint block definitions. The classification by the node EI value and the average block size for the local node TBT was introduced for simulated graphs by the Forest Fire Model. The new classification methodology is proposed irrespective on the graph structure.
Библиографическая ссылка: 
Маркович Н.М., Рыжов М.С. Random graph node classification by extremal index of PageRank / Proceedings of the 22nd International Scientific Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow). Moscow: РУДН, 2019. С. 313-320.