Login The Centiserver on OMICTools 
κPath CentralityDefinition
κpath node centrality
For each node v of a graph G = (V,E), the κpath node centrality C^{κ}(v) of v is defined as the sum, over all possible source nodes s, of the frequency with which a message originated from s goes through v, assuming that the message traversals are only along random simple paths of at most κ edges. where s are all the possible source nodes, σ^{κ}_{s}(v) is the number of κpaths originating from s and passing through v and σ^{κ}_{s} is the overall number of κpaths originating from s. See Geodesic KPath Edge Centrality See Geodesic KPath Centrality kPath centrality with randomalgorithm approach Taniarza, N. and Maharani, W., 2018, March. Social network analysis using kPath centrality method. In Journal of Physics: Conference Series (Vol. 971, No. 1, p. 012015). IOP Publishing. SoftwareReferences
