Greater Sage-grouse Least-cost Paths (LCPs) in the SageCon study area, southeastern and central Oregon

This dataset is a component of habitat connectivity analyses for Greater Sage-grouse (GSG) in southeastern and central Oregon conducted in 2014 in accord with the Sage Grouse Conservation Partnership (SageCon) by The Nature Conservancy in Oregon (TNC).  Spanning the SageCon Assessment Area within Oregon plus a 10-mile buffer, the data comprise least-cost paths (LCPs) relating to the structural connectivity, or ‘continuity’, of sage-grouse habitat amid the network of habitat patches defined by a ‘lek kernels’ dataset .  Each LCP identifies the single-cell wide route of least cumulative resistance for a sage grouse moving between a given pair of adjacent lek kernels.

Least-cost paths were identified and mapped with the Linkage Mapper toolset (McRae and Kavanagh 2011) using for inputs lek kernels data and a cost-weighted distance (CWD) surface. Linkage statistics yielded by Linkage Mapper were then used to characterize the relative ‘quality’ and ‘robustness’ of each LCP.

In context of the broader analysis, LCPs serve both as discrete representations of linkages between adjacent pairs in the lek kernel network and as a conceptual basis for least-cost corridors.  LCPs and corridors derive from the spatial configuration and continuity of habitat in the study landscape. While they depict modeled routes of least cumulative resistance, neither necessarily correlate with known routes of sage-grouse migration nor describe the likelihood of particular routes attempted by individuals.

The least-cost approach to modeling connectivity serves to complement the study’s circuit theoretic component in several respects. First, delineation of LCPs provides an intuitive and distinct visualization of the full analysis network. Second, metrics of linkage ‘quality’ and ‘robustness’ (combined in this study into a single metric; see ‘Linkage Statistics’) enable distinct comparison between linkages as represented by the LCPs. Third, corridors demarcate broad belts of land with relatively greater habitat continuity; such  ‘linkage zones’ are useful for framing potential conservation actions and for constraining models based in circuit theory (see ‘GSG_CON_BARRIERS' and 'GSG_CON_PINCHPTS').

Using Linkage Mapper, a preliminary network of lek kernels was constructed in which linked kernel pairs were defined by adjacency in either Euclidean or cost-weighted space. Minimum accumulated CWDs were calculated between each lek kernel pair, and an LCP mapped for each linkage with the exclusion of those that would intersect an intermediate lek kernel. The resulting initial network was then refined using a set of rules detailed in Jones et al. 2015 (see below).
To better inform comparisons between linkages in the refined analysis network (263 LCPs and 213 lek kernels) for conservation planning, statistics for each linkage were used to derive two linkage metrics and, in turn, a single composite linkage index.
The first metric, a measure of linkage ‘quality,’was based inversely on the ‘CWD to Path Length Ratio’, the total cumulative cost along an LCP divided by the Euclidean distance along the same path. This statistic, independent of LCP length, is a measure of the average resistance encountered along an LCP.
The second metric, interpreted as a measure of linkage ‘robustness’, stems from the ‘CWD to Effective Resistance Ratio’. The ‘effective resistance’statistic, calculated using Circuitscape within defined ‘linkage zones’, serves as a measure of the relative isolation of lek kernels that accounts for the availability of multiple movement routes. The ‘CWD to Effective Resistance Ratio,’in turn, can be understood as a measure of average corridor width, the availability of multiple, low-resistance routes within a corridor, and –by extension –the ‘robustness’of the linkage to being severed.
Raw statistic values from LCPs were standardized from 0 –1 to constitute each linkage metric and the metrics then multiplied to produce the ‘linkage index’.
The result served as an integrated measure of both linkage quality and average corridor width; higher values indicate stronger support for more focused consideration of protective conservation action in the linkage at finer scales. Conversely, lower values suggest poor quality and/or tenuous connections where restoration actions may be warranted when considered with the priorities of decision makers.
While the linkage index derives both from a statistic defined at scale the of a single-cell width (LCPs ) and a statistic defined at the scale of the linkage zones, the index was mapped to LCPs for the sake of greater visual clarity when superimposed over raster model outputs.
For more details, see: Jones et al. (2015), below.

The Nature Conservancy in Oregon

Jones, A., M. Schindel and S. Scott. 2015. Mapping Habitat Connectivity for Greater Sage-Grouse in Oregon’s Sage-Grouse Conservation Partnership (SageCon) Assessment Area. Produced by The Nature Conservancy (Portland OR) in partial fulfillment of BLM Cooperative Agreement L12AC20615. Available online: DOI: 10.13140/RG.2.2.22266.08640

McRae, B.H. and D.M. Kavanagh. 2011. Linkage Mapper Connectivity Analysis Software. The Nature Conservancy, Seattle WA. Available at: www.circuitscape.org/linkagemapper.

McRae, B.H., and V.B. Shah. 2009. Circuitscape user’s guide. The University of California, Santa Barbara. Available at: www.circuitscape.org.

The Nature Conservancy shall not be held liable for improper or incorrect use of the data described and/or contained herein. Any sale, distribution, loan, or offering for use of these digital data, in whole or in part, is prohibited without the approval of the Nature Conservancy. The use of these data to produce other GIS products and services with the intent to sell for a profit is prohibited without the written consent of the Nature Conservancy. All parties receiving these data must be informed of these restrictions. The Nature Conservancy shall be acknowledged as data contributors to any reports or other products derived from these data.