A landscape experiment of spatial network robustness and space‐use reorganization following habitat fragmentation

Combined effects of landscape fragmentation and sampling frequency of movement data on the assessment of landscape connectivity

BACKGROUND

Network theory is largely applied in real-world systems to assess landscape connectivity using empirical or theoretical networks. Empirical networks are usually built from discontinuous individual movement trajectories without knowing the effect of relocation frequency on the assessment of landscape connectivity while theoretical networks generally rely on simple movement rules. We investigated the combined effects of relocation sampling frequency and landscape fragmentation on the assessment of landscape connectivity using simulated trajectories and empirical high-resolution (1 Hz) trajectories of Alpine ibex (Capra ibex). We also quantified the capacity of commonly used theoretical networks to accurately predict landscape connectivity from multiple movement processes.

METHODS

We simulated forager trajectories from continuous correlated biased random walks in simulated landscapes with three levels of landscape fragmentation. High-resolution ibex trajectories were reconstructed using GPS-enabled multi-sensor biologging data and the dead-reckoning technique. For both simulated and empirical trajectories, we generated spatial networks from regularly resampled trajectories and assessed changes in their topology and information loss depending on the resampling frequency and landscape fragmentation. We finally built commonly used theoretical networks in the same landscapes and compared their predictions to actual connectivity.

RESULTS

We demonstrated that an accurate assessment of landscape connectivity can be severely hampered (e.g., up to 66% of undetected visited patches and 29% of spurious links) when the relocation frequency is too coarse compared to the temporal dynamics of animal movement. However, the level of landscape fragmentation and underlying movement processes can both mitigate the effect of relocation sampling frequency. We also showed that network topologies emerging from different movement behaviours and a wide range of landscape fragmentation were complex, and that commonly used theoretical networks accurately predicted only 30-50% of landscape connectivity in such environments.

CONCLUSIONS

Very high-resolution trajectories were generally necessary to accurately identify complex network topologies and avoid the generation of spurious information on landscape connectivity. New technologies providing such high-resolution datasets over long periods should thus grow in the movement ecology sphere. In addition, commonly used theoretical models should be applied with caution to the study of landscape connectivity in real-world systems as they did not perform well as predictive tools.

Spatial roost networks and resource selection of female wild turkeys

Wildlife demography is influenced by behavioural decisions, with sleep being a crucial avian behaviour. Avian species use roost sites to minimize thermoregulation costs, predation risk and enhance foraging efficiency. Sleep locations are often reused, forming networks within the home range. Our study, focusing on female eastern wild turkeys (Meleagris gallopavo silvestris) during the reproductive season, used social network analysis to quantify both roost site selection and network structure. We identified roost networks which were composed of a small percentage of hub roost sites connecting satellite roosts. Hub roosts were characterized by greater values of betweenness (β = 0.62, s.e. = 0.02), closeness (β = 0.59, s.e. = 0.03) and eigenvalue centrality (β = 1.15, s.e. = 0.05), indicating their importance as connectors and proximity to the network's functional centre. The probability of a roost being a hub increased significantly with greater eigenvalue centrality. Female wild turkeys consistently chose roost sites at lower elevations and with greater topographical ruggedness. Hub roost probability was higher near secondary roads and further from water. Our research highlights well-organized roost site networks around hub roosts, emphasizing the importance of further investigations into how these networks influence conspecific interactions, reproduction and resource utilization in wild turkeys.

Modelling the potential of forest management to mitigate climate change in Eastern Canadian forests

Climate change poses a serious risk to sustainable forest management, particularly in boreal forests where natural disturbances have been projected to become more severe. In three Quebec boreal forest management units, biomass carbon storage under various climate change and management scenarios was projected over 300 years (2010-2310) with a process-based dynamic landscape model (PnET-succession for Landis-II). Several strategies varying in their use of partial cuts and clear cuts, including business as usual (BAU) (clear-cut applied on more than 95% of the managed area), were tested and compared to conservation scenarios (no-harvest). Based on simulation results at the landscape scale, the clearcut-based scenarios such as BAU could result in a decrease of biomass carbon stock by 10 tC ha-1 yr-1 compared to the natural scenario. However, this reduction in carbon stock could be offset in the long term through changes in composition, as clearcut systems promote the expansion of trembling aspen and white birch. In contrast, the use of strategies based on partial cuts on more than 75% or 50% of the managed area was closer to or better than the natural scenario and resulted in greater coniferous cover retention. These strategies seemed to be the best to maximize and stabilize biomass carbon storage and ensure wood supply under different climate change scenarios, yet they would require further access and appropriate infrastructure. Furthermore, these strategies could maintain species compositions and age structures similar to natural scenarios, and thus may consequently help achieve forest ecosystem-based management targets. This study presents promising strategies to guide sustainable forest management in Eastern Canada in the context of climate change.

Maximising the clustering coefficient of networks and the effects on habitat network robustness

The robustness of networks against node failure and the response of networks to node removal has been studied extensively for networks such as transportation networks, power grids, and food webs. In many cases, a network's clustering coefficient was identified as a good indicator for network robustness. In ecology, habitat networks constitute a powerful tool to represent metapopulations or -communities, where nodes represent habitat patches and links indicate how these are connected. Current climate and land-use changes result in decline of habitat area and its connectivity and are thus the main drivers for the ongoing biodiversity loss. Conservation efforts are therefore needed to improve the connectivity and mitigate effects of habitat loss. Habitat loss can easily be modelled with the help of habitat networks and the question arises how to modify networks to obtain higher robustness. Here, we develop tools to identify which links should be added to a network to increase the robustness. We introduce two different heuristics, Greedy and Lazy Greedy, to maximize the clustering coefficient if multiple links can be added. We test these approaches and compare the results to the optimal solution for different generic networks including a variety of standard networks as well as spatially explicit landscape based habitat networks. In a last step, we simulate the robustness of habitat networks before and after adding multiple links and investigate the increase in robustness depending on both the number of added links and the heuristic used. We found that using our heuristics to add links to sparse networks such as habitat networks has a greater impact on the clustering coefficient compared to randomly adding links. The Greedy algorithm delivered optimal results in almost all cases when adding two links to the network. Furthermore, the robustness of networks increased with the number of additional links added using the Greedy or Lazy Greedy algorithm.