| pairwisedis {centiserve} | R Documentation |
Find the pairwise disconnectivity index
Description
The pairwise disconnectivity index of vertex v, Dis(v) defined as:
Dis(v)=\frac{N_{0}-N_{-v}}{N_{0}}=1-\frac{N_{-v}}{N_{0}}
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.
Usage
pairwisedis(graph, vids = V(graph))
Arguments
graph |
The input graph as igraph object |
vids |
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices. |
Details
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
Value
A numeric vector contaning the centrality scores for the selected vertices.
Author(s)
Mahdi Jalili m_jalili@farabi.tums.ac.ir
References
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.
Examples
g <- graph(c(1,2,2,3,3,4,4,2))
pairwisedis(g)