Higher Education Institutions (HEIs) play an increasingly significant role in the practice of sustainability. For HEIs in their early stages of sustainability, they are still in need of sustainable assessment tools (SATs) that are suitable for their local context and also lead international sustainable development. The purpose of this paper is to develop a two-hierarchy sustainability assessment tool (THSus) for Chinese higher education institutions, including a quick analysis tool (QAT) and an in-depth benchmarking tool (IBT). The QAT provided a general overview of campus sustainability for HEIs to initiate initial actions and screen cases for the IBT. The IBT then provides more targeted analysis to plan long-term strategic changes. Based on the analysis of HEI cases, a 34-person Chinese research team was enlisted to discuss and select characteristics to formulate THSus. Indicators and weightings were developed according to the tool’s purpose and applied to 15 cases to test its effectiveness. Results showed that THSus is suitable for systematically analyzing campus issues, particularly in research areas. It offers a regional solution for Chinese campuses that is adaptable and considers the comprehensive core of sustainability.

For this study, we investigated efficient strategies for the recovery of individual links in power grids governed by the direct current (DC) power flow model, under random link failures. Our primary objective was to explore the efficacy of recovering failed links based solely on topological network metrics. In total, we considered 13 recovery strategies, which encompassed 2 strategies based on link centrality values (link betweenness and link flow betweenness), 8 strategies based on the products of node centrality values at link endpoints (degree, eigenvector, weighted eigenvector, closeness, electrical closeness, weighted electrical closeness, zeta vector, and weighted zeta vector), and 2 heuristic strategies (greedy recovery and two-step greedy recovery), in addition to the random recovery strategy. To evaluate the performance of these proposed strategies, we conducted simulations on three distinct power systems: the IEEE 30, IEEE 39, and IEEE 118 systems. Our findings revealed several key insights: Firstly, there were notable variations in the performance of the recovery strategies based on topological network metrics across different power systems. Secondly, all such strategies exhibited inferior performance when compared to the heuristic recovery strategies. Thirdly, the two-step greedy recovery strategy consistently outperformed the others, with the greedy recovery strategy ranking second. Based on our results, we conclude that relying solely on a single metric for the development of a recovery strategy is insufficient when restoring power grids following link failures. By comparison, recovery strategies employing greedy algorithms prove to be more effective choices.

The average fraction of infected nodes, in short the prevalence, of the Markovian $\varepsilon$-SIS (susceptible-infected-susceptible) process with small self-infection rate $\varepsilon >0$ exhibits, as a function of time, a typical “two-plateau” behavior, which was first discovered in the complete graph $K_N$. Although the complete graph is often dismissed as an unacceptably simplistic approximation, its analytic tractability allows to unravel deeper details, that are surprisingly also observed in other graphs as demonstrated by simulations. The time-dependent mean-field approximation for $K_N$ performs only reasonably well for relatively large self-infection rates, but completely fails to mimic the typical Markovian $\varepsilon$-SIS process with small self-infection rates. While self-infections, particularly when their rate is small, are usually ignored, the interplay of nodal self-infection and spread over links may explain why absorbing processes are hardly observed in reality, even over long time intervals.

Network controllability and its robustness have been widely studied. However, analytical methods to calculate network controllability with respect to node in- and out-degree targeted removals are currently lacking. This paper develops methods, based on generating functions for the in- and out-degree distributions, to approximate the minimum number of driver nodes needed to control directed networks, during node in- and out-degree targeted removals. By validating the proposed methods on synthetic and real-world networks, we show that our methods work reasonably well. Moreover, when the fraction of the removed nodes is below 10% the analytical results of random removals can also be used to predict the results of targeted node removals.

Water Distribution Networks (WDNs) are critical infrastructures that ensure a continuous supply of safe water to homes. In the face of challenges, like water scarcity, establishing resilient networks is imperative, especially in regions vulnerable to water crises. This study evaluates the resilience of network designs through graph theory, including its hydraulic feasibility using EPANET software, an aspect often overlooked. Novel mathematical algorithms, including Resilience by Design (RbD) and Resilience-strengthening (RS) algorithms, provide cost-effective and resilient network designs, even with budget constraints. A novel metric, Water Availability (WA), is introduced to offer a comprehensive measure of network resilience, thereby addressing ongoing discrepancies in resilience evaluation methods. Practical benefits are illustrated through a case study in which a resilient-by-design reclaimed water network is created, and an existing equivalent non-resilient network is improved. The resilient-by-design network demonstrates remarkably better results compared to the equivalent non-resilient design, including up to a 36 % reduction in the probability of service disruptions and a nearly 65 % decrease in the annual average unserved water due to service disruptions. These findings underscore the enormous advantages of a resilience-focused network design approach. When compared to the equivalent non-resilient design, the resilient-by-design network generated effectively safeguards up to a significant 91,700m³ of water from the impacts of water disruption events over a 50-year operational period. In addition, the resilient-by-design WDN solution incurs a subtle decrease in overall costs compared to consuming tap water from the drinking WDN baseline over a 50-year operational period. These findings highlight the cost-effectiveness of the approach, even offering financial benefits. This paper builds on our previous research by expanding its scope to include resilience considerations, providing algorithms that can be easily adapted from reclaimed to drinking WDNs. Ultimately, we contribute to the enhancement of water resource management and infrastructure planning in ever-evolving urban environments.