CentiServer
comprehensive centrality resource and server for centralities calculation version: 1.0.0

Login




The Centiserver on OMICTools

OMICtools



Residual Closeness Centrality


Definition

Let dk(i, j) be the distance between vertices i and j in the graph, received from the original graph where all links of vertex k are deleted. We calculate the closeness after removing vertex k
Residual Closeness Centrality
The vertex residual closeness (VRC) of the graph can be defined as:
Residual Closeness Centrality
We can define analogously the graph link residual closeness (LRC)—the minimal of the closeness, calculated when only one link (k, p) is deleted.
Residual Closeness Centrality
To calculate it we use d(k,p)(i, j) — the distance between vertices i and j in the graph, received from the original graph where only the link (k, p) is deleted.

See Dangalchev Closeness Centrality

Software

References


Comments

There are no comment yet.

Add your comment

Name:
Email:
Sum of    and  
persianstat(10215502, 0);