Research of Topological Properties of Network Reflections Obtained Using Different Algorithms for Scanning Initial Networks
Lande D.V., Dmytrenko O.O.
In: Shkarlet S. et al. (eds) Mathematical Modeling and Simulation of Systems. MODS 2021. Lecture Notes in Networks and Systems, vol 344. Springer, Cham. Online ISBN 978-3-030-89902-8
DOI: https://doi.org/10.1007/978-3-030-89902-8_26
Many modern types of researches of networks use mechanisms for their monitoring, after which conclusions about the topology of such networks are drawn. This paper shows that this approach is wrong. The reflections of the initial networks obtained as a result of monitoring and partially reflect the properties of these initial networks is often significantly different. The properties of these network reflections significantly depend on the algorithms used for scanning the initial network. To demonstrate this statement, the paper researches the properties of network reflections obtained using three scanning algorithms, which implement the following principles: (1) the transition to the node according to the PageRank algorithm; (2) the transition to the node that has the highest PageRank; (3) the transition to the node that has the highest degree. The networks based on the Erdös-Renyi and Barabási-Albert models are considered as basic. The paper shows that the values of the characteristics of network reflections, which are close to the topology and characteristics of the initial networks, are achieved only during approaching the scanning steps to the number of nodes in these initial networks. The obtained results are important in the methodical plan and can be considered as a statement of a problem of finding the algorithm of scanning of a complex network using of which gives most adequately parameters of the initial network (first of all, the degree distribution).
Keywords: Monitoring, Network scanning , Network topology, Barabási-Albert model, Erdös-Renyi model, PageRank algorithm, Network density, Degree, Degree distribution, Power law