skip to main content

Title: Multilayer Network Clarifies Prevailing Water Consumption Telecouplings in the United States

Virtual water flows are used to map the indirect water consumption connections implied by the supply chain of a city, region, or country. This information can be used to manage supply chains to achieve environmental policy objectives and mitigate environmental risks to critical supply chains. A limitation of prior work is that these flows are typically analyzed using monolayer networks, which ignores crucial intersectoral or interlayer couplings. Here, we use a multilayer network to account for such couplings when analyzing blue virtual water flows in the United States. Our multilayer network consists of 115 different regions (nodes), covering the entire conterminous United States; 41 coupled economic sectors (layers); and ∼2 × 107possible links. To analyze the multilayer network, we focus on three fundamental network properties: topological connectivity, mesoscale structure, and node centrality. The network has a high connectivity, with each node being on average connected to roughly 2/3 of the network's nodes. Interlayer flows are a major driver of connectivity, representing ∼54% of all the network's connections. Five different groups of tightly connected nodes (communities) characterize the network. Each community represents a preferred spatial mode of long‐range virtual water interaction within the United States. We find that large (populous) cities have a stronger influence than small ones on network functioning because they attract and recirculate more virtual water through their supply chains. Our results also highlight differences between the multilayer and monolayer virtual water network, which overall show that the former provides a more realistic representation of virtual water flows.

more » « less
Award ID(s):
Author(s) / Creator(s):
 ;  ;  ;  ;  
Publisher / Repository:
DOI PREFIX: 10.1029
Date Published:
Journal Name:
Water Resources Research
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We consider the ad-hoc networks consisting of n wireless nodes that are located on the plane. Any two given nodes are called neighbors if they are located within a certain distance (communication range) from one another. A given node can be directly connected to any one of its neighbors, and picks its connections according to a unique topology control algorithm that is available at every node. Given that each node knows only the indices (unique identification numbers) of its one and two-hop neighbors, we identify an algorithm that preserves connectivity and can operate without the need of any synchronization among nodes. Moreover, the algorithm results in a sparse graph with at most 5n edges and a maximum node degree of 10. Existing algorithms with the same promises further require neighbor distance and/or direction information at each node. We also evaluate the performance of our algorithm for random networks. In this case, our algorithm provides an asymptotically connected network with n(1+o(1)) edges with a degree less than or equal to 6 for 1-o(1) fraction of the nodes. We also introduce another asynchronous connectivity-preserving algorithm that can provide an upper bound as well as a lower bound on node degrees. 
    more » « less
  2. Abstract We define a bridge node to be a node whose neighbor nodes are sparsely connected to each other and are likely to be part of different components if the node is removed from the network. We propose a computationally light neighborhood-based bridge node centrality (NBNC) tuple that could be used to identify the bridge nodes of a network as well as rank the nodes in a network on the basis of their topological position to function as bridge nodes. The NBNC tuple for a node is asynchronously computed on the basis of the neighborhood graph of the node that comprises of the neighbors of the node as vertices and the links connecting the neighbors as edges. The NBNC tuple for a node has three entries: the number of components in the neighborhood graph of the node, the algebraic connectivity ratio of the neighborhood graph of the node and the number of neighbors of the node. We analyze a suite of 60 complex real-world networks and evaluate the computational lightness, effectiveness, efficiency/accuracy and uniqueness of the NBNC tuple vis-a-vis the existing bridgeness related centrality metrics and the Louvain community detection algorithm. 
    more » « less
  3. Summary Objective

    Identification of patient‐specific epileptogenic networks is critical to designing successful treatment strategies. Multiple noninvasive methods have been used to characterize epileptogenic networks. However, these methods lack the spatiotemporal resolution to allow precise localization of epileptiform activity. We used intracranial recordings, at much higher spatiotemporal resolution, across a cohort of patients with mesial temporal lobe epilepsy (MTLE) to delineate features common to their epileptogenic networks. We used interictal rather than seizure data because interictal spikes occur more frequently, providing us greater power for analyzing variances in the network.


    Intracranial recordings from 10 medically refractoryMTLEpatients were analyzed. In each patient, hour‐long recordings were selected for having frequent interictal discharges and no ictal events. For all possible pairs of electrodes, conditional probability of the occurrence of interictal spikes within a 150‐millisecond bin was computed. These probabilities were used to construct a weighted graph between all electrodes, and the node degree was estimated. To assess the relationship of the highly connected regions in this network to the clinically identified seizure network, logistic regression was used to model the regions that were surgically resected using weighted node degree and number of spikes in each channel as factors. Lastly, the conditional spike probability was normalized and averaged across patients to visualize theMTLEnetwork at group level.


    We generated the first graph of connectivity across a cohort ofMTLEpatients using interictal activity. The most consistent connections were hippocampus to amygdala, anterior fusiform cortex to hippocampus, and parahippocampal gyrus projections to amygdala. Additionally, the weighted node degree and number of spikes modeled the brain regions identified as seizure networks by clinicians.


    Apart from identifying interictal measures that can model patient‐specific epileptogenic networks, we also produce a group map of network connectivity from a cohort ofMTLEpatients.

    more » « less
  4. Abstract

    Through the trade of products and services, cities indirectly depend on distant water sources to function, prosper, and grow. To fully account for indirect (virtual) water dependencies, virtual water flows need to be known along complex supply chains. To this purpose, we build a new environmental multiregional input–output model for U.S. regions. The model is used to quantify the domestic, blue virtual water flows and analyze the water footprints of 69 major U.S. cities. Our results show a large inequality in the urban water consumed for economic production: just 7 out of the 69 cities included in this study account for 35% of the U.S. national water footprint of production. This is due to the production of water‐intensive agricultural products in the metropolitan areas of western cities. The inequality reduces for the urban water footprint of consumption because, through the supply chains of industrialized food sectors, western virtual water is partially transferred to eastern cities as final demand. The water embodied in industrial products and services tends to be higher in western cities than in eastern cities; that is, the water embodied in food services could be several times higher in Los Angeles than in New York City. Trade hub cities attract large inflows of products which are mostly transformed for consumption elsewhere. Thus, the omission of product interdependencies within trade hub cities can increase by several times their water footprints of consumption. Overall, the proposed model is able to enhance subnational estimates of U.S. virtual water flows.

    more » « less
  5. Biscarat, C. ; Campana, S. ; Hegner, B. ; Roiser, S. ; Rovelli, C.I. ; Stewart, G.A. (Ed.)
    The processing needs for the High Luminosity (HL) upgrade for the LHC require the CMS collaboration to harness the computational power available on non-CMS resources, such as High-Performance Computing centers (HPCs). These sites often limit the external network connectivity of their computational nodes. In this paper we describe a strategy in which all network connections of CMS jobs inside a facility are routed to a single point of external network connectivity using a Virtual Private Network (VPN) server by creating virtual network interfaces in the computational nodes. We show that when the computational nodes and the host running the VPN server have the namespaces capability enabled, the setup can run entirely on user space with no other root permissions required. The VPN server host may be a privileged node inside the facility configured for outside network access, or an external service that the nodes are allowed to contact. When namespaces are not enabled at the client side, then the setup falls back to using a SOCKS server instead of virtual network interfaces. We demonstrate the strategy by executing CMS Monte Carlo production requests on opportunistic non-CMS resources at the University of Notre Dame. For these jobs, cvmfs support is tested via fusermount (cvmfsexec), and the native fuse module. 
    more » « less