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”

Parametric definition of the influence of a paper in a citation network using communicability functions

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F19%3A00338043" target="_blank" >RIV/68407700:21340/19:00338043 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1093/comnet/cny037" target="_blank" >https://doi.org/10.1093/comnet/cny037</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1093/comnet/cny037" target="_blank" >10.1093/comnet/cny037</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parametric definition of the influence of a paper in a citation network using communicability functions

  • Original language description

    Communicability functions quantify the flow of information between two nodes of a network. In this work, we use them to explore the concept of the influence of a paper in a citation network. These functions depend on a parameter. By varying the parameter in a continuous way we explore different definitions of influence. We study six citation networks, three from physics and three from computer science. As a benchmark, we compare our results against two frequently used measures: the number of citations of a paper and the PageRank algorithm. We show that the ranking of the articles in a network can be varied from being equivalent to the ranking obtained from the number of citations to a behaviour tending to the eigenvector centrality, these limits correspond to small and large values of the communicability-function parameter, respectively. At an intermediate value of the parameter a PageRank-like behaviour is recovered. As a test case, we apply communicability functions to two sets of articles, where at least one author of each paper was awarded a Nobel Prize for the research presented in the corresponding article.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>ost</sub> - Miscellaneous article in a specialist periodical

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • 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

    JOURNAL OF COMPLEX NETWORKS

  • ISSN

    2051-1310

  • e-ISSN

    2051-1329

  • Volume of the periodical

    7

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    18

  • Pages from-to

    623-640

  • UT code for WoS article

    000481609800009

  • EID of the result in the Scopus database