Quantifying the reliability of dispersal paths in connectivity networks.

ABSTRACT

Many biological systems, from fragmented landscapes to host populations, can be represented as networks of connected habitat patches. Links between patches in these connectivity networks can represent equally diverse processes, from individuals moving through the landscape to pathogen transmissions or successive colonization events in metapopulations. Any of these processes can be characterized as stochastic, with functional links among patches that exist with various levels of certainty. This stochasticity then needs to be reflected in the algorithms that aim to predict the dispersal routes in these networks. Here we adapt the concept of reliability to characterize the likelihood that a specific path will be used for dispersal in a probabilistic connectivity network. The most reliable of the paths that connect two patches will then identify the most likely sequence of intermediate steps between these patches. Path reliability will be sensitive to targeted disruptions of individual links that form the path, and this can then be used to plan the interventions aimed at either preserving or disrupting the dispersal along that path. The proposed approach is general, and can be used to identify the most likely dispersal routes in various contexts, such as predicting patterns of migrations, colonizations, invasions and epidemics.