Table 3 Measures of shortest path-related centrality measures commonly used in ecological network analysis.

From: Ecological networks: Pursuing the shortest path, however narrow and crooked

Centrality Measure

Definition

Formula

Intended Network type

Reference

Betweenness, BC

Quantifies the proportion of shortest paths g between any two nodes i, j, that pass through a focal node v.

\(BC(v)=\frac{\sum _{i\ne v\ne j}{g}_{ij}(v)}{{g}_{ij}}\)

All types

15

Stress, SC

Measures the number of shortest paths g between any two nodes i, j, that pass through a focal node v.

\(SC(v)=\sum _{i\ne v\ne j}{g}_{ij}(v)\)

All types

17

Closeness, CC

Measures the average length of the shortest paths from a node v to all the other nodes in the network.

\(CC(v)=\frac{N-{\rm{1}}}{\sum _{j}{g}_{vj}}\)

All types

15

Integral Index of Connectivity, IIC

Measures the degree of connectivity of the entire landscape (of total area AL) through the calculation of the number of edges in the shortest path nlij between patches with area ai and aj.

\(IIC(v)=\frac{\mathop{\sum }\limits_{i={\rm{1}}}^{n}\mathop{\sum }\limits_{j={\rm{1}}}^{n}{a}_{i}{a}_{j}/({\rm{1}}+n{l}_{ij})}{{A}_{L}^{{\rm{2}}}}\)

Binary landscape networks

61

Probability of Connectivity Index, PC

Quantifies the probability that two species randomly placed across a patchy landscape (of total area AL) fall into habitat patches ai and aj that are reachable from each other with a maximum connectivity probability pij, defined as the maximum product probability of all possible paths between patches i and j (including single-step paths).

\(PC(v)=\frac{\mathop{\sum }\limits_{i={\rm{1}}}^{n}\mathop{\sum }\limits_{j={\rm{1}}}^{n}{a}_{i}{a}_{j}{\dot{p}}_{ij}}{{A}_{L}^{{\rm{2}}}}\)

Landscape networks

62

  1. Notice that other common centrality measures are based on eigenvectors or dissimilarity scores instead of on the identification of shortest paths and are hence not considered in this work.