All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Local Dependency in Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096673" target="_blank" >RIV/61989100:27240/15:86096673 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/15:86096673

  • Result on the web

    <a href="http://dx.doi.org/10.1515/amcs-2015-0022" target="_blank" >http://dx.doi.org/10.1515/amcs-2015-0022</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1515/amcs-2015-0022" target="_blank" >10.1515/amcs-2015-0022</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Local Dependency in Networks

  • Original language description

    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 ofthe 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 structurein 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 effecti

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Applied Mathematics and Computer Science

  • ISSN

    1641-876X

  • e-ISSN

  • Volume of the periodical

    25

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    PL - POLAND

  • Number of pages

    13

  • Pages from-to

    281-293

  • UT code for WoS article

    000358017900008

  • EID of the result in the Scopus database

    2-s2.0-84934268517