The pairwise disconnectivity index of vertex v, Dis(v) defined as:
where N(0) is the total number of ordered pairs of vertices in a network that are connected by at least one directed path of any length. It is supposed that N(0) > 0, i.e., there exists at least one edge in the network that links two different vertices. N(-v) is the number of ordered pairs that are still connected after removing vertex v from the network, via alternative paths through other vertices.
pairwisedis(graph, vids = V(graph))
The input graph as igraph object
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.
The pairwise disconnectivity defined as index of vertex v, Dis(v), as the fraction of those initially connected pairs of vertices in a network which become disconnected if vertex v is removed from the network. The pairwise disconnectivity index quantifies how crucial an individual element is for sustaining the communication ability between connected pairs of vertices in a network that is displayed as a directed graph.
More detail at Pairwise Disconnectivity Index
A numeric vector contaning the centrality scores for the selected vertices.
Mahdi Jalili [email protected]
Potapov, Anatolij P., Bjorn Goemann, and Edgar Wingender. "The pairwise disconnectivity index as a new metric for the topological analysis of regulatory networks." BMC bioinformatics 9.1 (2008): 227.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.