Decay centrality is a centrality measure based on the proximity between a choosen vertex and every other vertex weighted by the decay. More precisely, decay centrality of a given vertex x of a graph G is define as:
where d(x, y) denotes the distance between x and y and δ ∈ (0, 1) is a parameter.
Require strongly connected network.
- JACKSON, M. 2008. Representing and Measuring Networks. Social and economic networks, 20-53.
- Jana Hurajová, Silvia Gago and Tomáš Madaras, Decay Centrality, 15th Conference of Košice Mathematicians. Herl’any 2.–5. apríla 2014.
- Toropov, B., 2017. Decay centrality in social graphs and Flajolet-Martin algorithm adaptation for its computation. International Journal of Open Information Technologies, 5(9), pp.27-33.
There are no comment yet.