Building landscape ecological network with multi-scenario connectivity based on network fault tolerance index and networking technology in graph theory

Abstract

Existing methods for constructing Landscape Ecological Networks (LEN) either focus on functional attributes or structural attributes and also do not address the dynamic impact of urban development on ecological spaces. To address these limitations, this paper proposed evaluating the maximum connectivity (k) of potential LEN, composed of existing ecological spaces, using a network fault tolerance index. We then used graph-based networking technology to construct the optimal LEN structure based on this index. Specifically speaking, first, we identified the existing LEN with the highest ecosystem service capacity and lowest ecological cost in the study area. Using four landscape pattern metrics, we comprehensively evaluated the fault tolerance index as the maximum connectivity k of potential LEN and determined that k = 7. We then modeled the existing LEN as a weighted graph and transformed the network optimization problem into a k-edge addition problem. This calculation yielded seven LEN schemes, each corresponding to different priority orders of new ecological corridors based on k value. This index captures changes in ecological space patterns and offers diverse LEN optimization solutions. It provides practitioners with flexible spatial strategies to address the dynamic impacts of urbanization.

Keywords

• Landscape ecological network optimization
• Network fault tolerance index
• Network connectivity enhancement
• K-edge augmentation
• Networking technology
• Multi-scenario planning