Login The Centiserver on OMICTools |
Flux CentralityDefinition
This centrality developed based on the concept of maximum flow. Considering any two vertices s and t in a network, the maximum flow between the two is defined by the largest flow that is observed for all possible paths connecting the two [AHUJA, R. K., 1993]. In simple terms, out of the many connecting paths we are looking for a set of paths forming the ‘strongest carbon flux’ connecting s and t. Denote this maximum flow between s and t as max_flow (s,t). According shortest-path closeness centrality, which sums the lengths of the shortest-paths from a vertex s to all other vertices t (t∈V, V is the set of all vertices in the network), the maximum-flow closeness defined as:
![]() SoftwareReferences
|