On decay centrality in graphs

• Jana Coroničová Hurajová ^[1] ; Silvia Gago ^[2] ; Tomáš Madaras ^[3]
  1. [1] University of Economics in Bratislava

     University of Economics in Bratislava

     Eslovaquia

     
  2. [2] Universitat Politècnica de Catalunya

     Universitat Politècnica de Catalunya

     Barcelona, España

     
  3. [3] University of Pavol Jozef Šafárik

     University of Pavol Jozef Šafárik

     Eslovaquia

     

  Mostrar afiliaciones +
• Localización: Mathematica scandinavica, ISSN 0025-5521, Vol. 123, Nº 1, 2018, págs. 39-50
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • The decay centrality of a vertexvin a graphGwith respect to a parameterδ∈(0,1)is apolynomial inδsuch that for fixedkthe coefficient ofδkis equal to the number of vertices ofGat distancekfromv. This invariant (introduced independently by Jackson and Wolinsky in 1996and Dangalchev in 2011) is considered as a replacement for the closeness centrality for graphs,however its unstability was pointed out by Yang and Zhuhadar in 2011. We explore mathematicalproperties of decay centrality depending on the choice of parameterδand the stability of vertexranking based on this centrality index.