Resumen de On decay centrality in graphs

Jana Coroničová Hurajová, Sílvia Gago Álvarez, Tomás Madaras

• 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.