Landscape connectivity: A graph-theoretic perspective

Ecologists are familiar with two data structures commonly used to represent landscapes. Vector-based maps delineate land cover types as polygons, while raster lattices represent the landscape as a grid. Here we adopt a third lattice data structure, the graph. A graph represents a landscape as a set of nodes (e.g., habitat patches) connected to some degree by edges that join pairs of nodes functionally (e.g., via dispersal). Graph theory is well developed in other fields, including geography (transportation networks, routing applications, siting problems) and computer science (circuitry and network optimization). We present an overview of basic elements of graph theory as it might be applied to issues of connectivity in heterogeneous landscapes, focusing especially on applications of metapopulation theory in conservation biology. We develop a general set of analyses using a hypothetical landscape mosaic of habitat patches in a nonhabitat matrix. Our results suggest that a simple graph construct, the minimum spanning tree, can serve as a powerful guide to decisions about the relative importance of individual patches to overall landscape connectivity. We then apply this approach to an actual conservation scenario involving the threatened Mexican Spotted Owl (Strix occidentalis lucida). Simulations with an incidence-function metapopulation model suggest that population persistence can be maintained despite substantial losses of habitat area, so long as the minimum spanning tree is protected. We believe that graph theory has considerable promise for applications concerned with connectivity and ecological flows in general. Because the theory is already well developed in other disciplines, it might be brought to bear immediately on pressing ecological applications in conservation biology and landscape ecology.

Duke Scholars

Author Dean L. Urban Environmental Sciences and Policy