Relaxation time in complex network
Dmytro Lande, Andrei Snarskii, Oleh Dmytrenko, Igor Subach

ARES '20: Proceedings of the 15th International Conference on Availability, Reliability and SecurityAugust 2020 Article No.: 99 Pages 1-6.
DOI: https://doi.org/10.1145/3407023.3409231
New characteristics of nodes of network structures are proposed and researched in this work - the relaxation time of network and the individual relaxation time of node. The so-called decelerated iteration algorithms for HITS and PageRank are used to obtain the relaxation time.
The relaxation time of network and the individual relaxation time of node were tested on the example of a weighted directed network of characters in the novel.Les Miserables.. It was found that a topology of a network affects a relaxation of nodes after their perturbation.
As a result of using relaxation time it was possible to identify the most important network components and rank them by the proposed characteristics.
The resulted ranking compared to the ranking by HITS, PageRank and degree of nodes shows the uniqueness of the proposed relaxation time of network and individual relaxation time of node.

Keywords: Complex network, Perturbation of node scores, Relaxation time of
network, Individual relaxation time of node, HITS, PageRank.

© 2021, Oleh Dmytrenko
dmitrenko_o@ukr.net
This site was made on Tilda — a website builder that helps to create a website without any code
Create a website