@inproceedings{badbb4631b124596823195c5f23fb317,
title = "Random Graph Node Classification by Extremal Index of PageRank",
abstract = "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 and Erd{\H o}s-R{\'e}nyi Models and the Berkeley-Stanford dataset as a real example. The new classification methodology is proposed irrespective on the graph structure.",
keywords = "Bootstrap, Disjoint block, Extremal index, PageRank, Random graph, Sliding block",
author = "Markovich, {Natalia M.} and Ryzhov, {Maxim S.}",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 22nd International Conference on Distributed and Computer and Communication Networks, DCCN 2019 ; Conference date: 23-09-2019 Through 27-09-2019",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-36625-4_34",
language = "English",
isbn = "9783030366247",
series = "Communications in Computer and Information Science",
publisher = "Springer",
pages = "424--435",
editor = "Vishnevskiy, {Vladimir M.} and Kozyrev, {Dmitry V.} and Samouylov, {Konstantin E.} and Kozyrev, {Dmitry V.}",
booktitle = "Distributed Computer and Communication Networks - 22nd International Conference, DCCN 2019, Revised Selected Papers",
address = "Germany",
}