A General Approach to Model Movement in (Highly) Fragmented Patch Networks

Abstract

Landscape heterogeneity can often be represented as a series of discrete habitat or resource patches surrounded by a matrix of non-habitat. Understanding how animals move in such networks of patches is important for many theoretical and applied questions. The probability of going from one patch to another is affected in a non-trivial way by the characteristics and location of other patches in the network. Nearby patches can compete as possible destinations, and a particular patch can be shadowed by neighboring patches. We present a way to account for the effects of the spatial configuration of patches in models of space use where individuals alternate between spending time in a patch and moving to other patches in the network. The approach is based on the original derivation of Ovaskainen and Cornell (J Appl Probab 40:557–580, 2003) for a diffusion model that considered all possible ways in which an individual leaving a particular patch can eventually reach another patch before dying or leaving the patch network. By replacing the theoretical results of Ovaskainen and Cornell by other appropriate functions, we provide generality and thus make their approach useful in contexts where diffusion is not a good approximation of movement. Furthermore, we provide ways to estimate time spent in the non-habitat matrix when going from patch to patch and implement a method to incorporate the effect of the history of previous visits on future patch use. We present an MCMC way to fit these models to data and illustrate the approach with both simulated data and data from sheep moving among seasonally flooded meadows in northern Patagonia.Supplementary materials accompanying this paper appear online.