Greater sage-grouse closeness centrality of fully connected population structure in the western United States

Closeness centrality (cc; grsg_lcp_closeness_centrality) measures the average length of the shortest path between the node and all other nodes in the graph. The more central a node, the closer it is to all other nodes and the more likely information/movements can flow to other nodes. Closeness is computed as one divided by the average path lengths from a node to its neighbors, which assumes that important nodes are close to other nodes. The data were defined from least-cost paths (LCPs) constructed into minimum spanning trees (MSTs). We identified a threshold of the cc normalized value (>0.047) where patterns of network connectivity occurred in our graph. The cc identified leks with the greatest number of shortest paths between neighboring [...]