Have a personal or library account? Click to login
Local dependency in networks Cover

Abstract

Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network’s nodes from the structure in local surroundings of individual nodes. For the tasks we deal with in this article, the key technical parameter is locality. Since only the surroundings of the examined nodes are used in computations, there is no need to analyze the entire network. This allows the application of our approach in the area of large-scale networks. We present several experiments using small networks as well as large-scale artificial and real world networks. The results of the experiments show high effectiveness due to the locality of our approach and also high quality node ranking comparable to PageRank.

DOI: https://doi.org/10.1515/amcs-2015-0022 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 281 - 293
Submitted on: Feb 4, 2014
Published on: Jun 25, 2015
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2015 Miloš Kudĕlka, Šárka Zehnalová, Zdenĕk Horák, Pavel Krömer, Václav Snášel, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.