Robustness of Network Controllability with Respect to Node Removals Based on In-Degree and Out-Degree.

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.

Recovering Power Grids Using Strategies Based on Network Metrics and Greedy Algorithms.

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.

Enhancing reclaimed water distribution network resilience with cost-effective meshing.

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,700m3 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.

Transition from simple to complex contagion in collective decision-making.

How does the spread of behavior affect consensus-based collective decision-making among animals, humans or swarming robots? In prior research, such propagation of behavior on social networks has been found to exhibit a transition from simple contagion-i.e, based on pairwise interactions-to a complex one-i.e., involving social influence and reinforcement. However, this rich phenomenology appears so far limited to threshold-based decision-making processes with binary options. Here, we show theoretically, and experimentally with a multi-robot system, that such a transition from simple to complex contagion can also bed observed in an archetypal model of distributed decision-making devoid of any thresholds or nonlinearities. Specifically, we uncover two key results: the nature of the contagion-simple or complex-is tightly related to the intrinsic pace of the behavior that is spreading, and the network topology strongly influences the effectiveness of the behavioral transmission in ways that are reminiscent of threshold-based models. These results offer new directions for the empirical exploration of behavioral contagions in groups, and have significant ramifications for the design of cooperative and networked robot systems.

Genomic characterization of multidrug-resistant ESBL-producing Escherichia coli ST58 causing fatal colibacillosis in critically endangered Brazilian merganser (Mergus octosetaceus).

Even though antimicrobial-resistant bacteria have begun to be detected in wildlife, raising important issues related to their transmission and persistence of clinically important pathogens in the environment, little is known about the role of these bacteria on wildlife health, especially on endangered species. The Brazilian merganser (Mergus octosetaceus) is one of the most threatened waterfowl in the world, classified as Critically Endangered by the International Union for Conservation of Nature. In 2019, a fatal case of sepsis was diagnosed in an 8-day-old Brazilian merganser inhabiting a zoological park. At necropsy, major gross lesions were pulmonary and hepatic congestion. Using microbiologic and genomic methods, we identified a multidrug-resistant (MDR) extended-spectrum ß-lactamase (ESBL) CTX-M-8-producing Escherichia coli (designed as PMPU strain) belonging to the international clone ST58, in coelomic cavity, oesophagus, lungs, small intestine and cloaca samples. PMPU strain harboured a broad resistome against antibiotics (cephalosporins, tetracyclines, aminoglycosides, sulphonamides, trimethoprim and quinolones), domestic/hospital disinfectants and heavy metals (arsenic, mercury, lead, copper and silver). Additionally, the virulence of E. coli PMPU strain was confirmed using a wax moth (Galleria mellonella) infection model, and it was supported by the presence of virulence genes encoding toxins, adherence factors, invasins and iron acquisition systems. Broad resistome and virulome of PMPU contributed to therapeutic failure and death of the animal. In brief, we report for the first time a fatal colibacillosis by MDR ESBL-producing E. coli in critically endangered Brazilian merganser, highlighting that besides colonization, critical priority pathogens are threatening wildlife. E. coli ST58 clone has been previously reported in humans, food-producing animals, wildlife and environment, supporting broad adaptation and persistence at human-animal-environment interface.

Structural transition in interdependent networks with regular interconnections.

Networks are often made up of several layers that exhibit diverse degrees of interdependencies. An interdependent network consists of a set of graphs G that are interconnected through a weighted interconnection matrix B, where the weight of each intergraph link is a non-negative real number p. Various dynamical processes, such as synchronization, cascading failures in power grids, and diffusion processes, are described by the Laplacian matrix Q characterizing the whole system. For the case in which the multilayer graph is a multiplex, where the number of nodes in each layer is the same and the interconnection matrix B=pI, I being the identity matrix, it has been shown that there exists a structural transition at some critical coupling p^{*}. This transition is such that dynamical processes are separated into two regimes: if p>p^{*}, the network acts as a whole; whereas when p

Modeling region-based interconnection for interdependent networks.

Various real-world networks interact with and depend on each other. The design of the interconnection between interacting networks is one of the main challenges to achieve a robust interdependent network. Due to cost considerations, network providers are inclined to interconnect nodes that are geographically close. Accordingly, we propose two topologies, the random geographic graph and the relative neighborhood graph, for the design of interconnection in interdependent networks that incorporates the geographic location of nodes. Differing from the one-to-one interconnection studied in the literature, one node in one network can depend on an arbitrary number of nodes in the other network. We derive the average number of interdependent links for the two topologies, which enables their comparison. For the two topologies, we evaluate the impact of the interconnection structure on the robustness of interdependent networks against cascading failures. The two topologies are assessed on the real-world coupled Italian Internet and the electric transmission network. Finally, we propose the derivative of the largest mutually connected component with respect to the fraction of failed nodes as a robustness metric. This robustness metric quantifies the damage of the network introduced by a small fraction of initial failures well before the critical fraction of failures at which the whole network collapses.