Flow-directed PCA for monitoring networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Gallacher K
PROVIDER: S-EPMC5347935 | biostudies-literature | 2017 Mar
REPOSITORIES: biostudies-literature
Publications
Flow-directed PCA for monitoring networks.
Gallacher K K Miller C C Scott E M EM Willows R R Pope L L Douglass J J
Environmetrics 20161221 2
Measurements recorded over monitoring networks often possess spatial and temporal correlation inducing redundancies in the information provided. For river water quality monitoring in particular, flow-connected sites may likely provide similar information. This paper proposes a novel approach to principal components analysis to investigate reducing dimensionality for spatiotemporal flow-connected network data in order to identify common spatiotemporal patterns. The method is illustrated using mon ...[more]
Similar Datasets
Project description:When we represent real-world systems as networks, the directions of links often convey valuable information. Finding module structures that respect link directions is one of the most important tasks for analysing directed networks. Although many notions of a directed module have been proposed, no consensus has been reached. This lack of consensus results partly because there might exist distinct types of modules in a single directed network, whereas most previous studies focused on an independent criterion for modules. To address this issue, we propose a generic notion of the so-called truss structures in directed networks. Our definition of truss is able to extract two distinct types of trusses, named the cycle truss and the flow truss, from a unified framework. By applying the method for finding trusses to empirical networks obtained from a wide range of research fields, we find that most real networks contain both cycle and flow trusses. In addition, the abundance of (and the overlap between) the two types of trusses may be useful to characterize module structures in a wide variety of empirical networks. Our findings shed light on the importance of simultaneously considering different types of modules in directed networks.
| S-EPMC5180108 | biostudies-literature
Project description:Along with the development of information and technology, the quality characteristics of a product cannot be monitored separately in the different types of control charts. In the past, conventional control charts were developed to monitor only one type of quality characteristic. The variable control charts are used to observe the variable or metric quality characteristics. Meanwhile, in monitoring non-metric characteristics or categorical data, attribute control charts are employed. To accommodate these two types of data, the PCA Mix control chart is suggested to simultaneously monitor these two types of data in one chart. However, some drawbacks occur when this chart is applied to monitor non-metric data which has an imbalanced proportion. Therefore, the Kernel PCA Mix control chart is created to overcome the gaps that occurred in the PCA Mix chart. Similar to the previous chart, this chart is also constructed using Hotelling's T2 statistics with Kernel Density Estimation control limit. Several simulations are used to evaluate the performance of the proposed control charts. The simulation results show that the proposed chart has a better result than the previous control chart, especially for a small mean shift with an imbalanced proportion of non-metric data. However, the PCA Mix chart has a similar performance to the proposed chart when it is applied to monitor the balanced proportion of categorical data with a large mean shift. The application with simulated data with various scenarios and the real-world case also shows that the Kernel PCA Mix chart performs better compared to the performance of the PCA Mix chart.
| S-EPMC9489795 | biostudies-literature
Project description:Directionality is a crucial ingredient in many complex networks in which information, energy or influence are transmitted. In such directed networks, analysing flows (and not only the strength of connections) is crucial to reveal important features of the network that might go undetected if the orientation of connections is ignored. We showcase here a flow-based approach for community detection through the study of the network of the most influential Twitter users during the 2011 riots in England. Firstly, we use directed Markov Stability to extract descriptions of the network at different levels of coarseness in terms of interest communities, i.e. groups of nodes within which flows of information are contained and reinforced. Such interest communities reveal user groupings according to location, profession, employer and topic. The study of flows also allows us to generate an interest distance, which affords a personalized view of the attention in the network as viewed from the vantage point of any given user. Secondly, we analyse the profiles of incoming and outgoing long-range flows with a combined approach of role-based similarity and the novel relaxed minimum spanning tree algorithm to reveal that the users in the network can be classified into five roles. These flow roles go beyond the standard leader/follower dichotomy and differ from classifications based on regular/structural equivalence. We then show that the interest communities fall into distinct informational organigrams characterized by a different mix of user roles reflecting the quality of dialogue within them. Our generic framework can be used to provide insight into how flows are generated, distributed, preserved and consumed in directed networks.
| S-EPMC4223916 | biostudies-literature
Project description:Increasing evidence shows that real-world systems interact with one another via dependency connectivities. Failing connectivities are the mechanism behind the breakdown of interacting complex systems, e.g., blackouts caused by the interdependence of power grids and communication networks. Previous research analyzing the robustness of interdependent networks has been limited to undirected networks. However, most real-world networks are directed, their in-degrees and out-degrees may be correlated, and they are often coupled to one another as interdependent directed networks. To understand the breakdown and robustness of interdependent directed networks, we develop a theoretical framework based on generating functions and percolation theory. We find that for interdependent Erd?s-Rényi networks the directionality within each network increases their vulnerability and exhibits hybrid phase transitions. We also find that the percolation behavior of interdependent directed scale-free networks with and without degree correlations is so complex that two criteria are needed to quantify and compare their robustness: the percolation threshold and the integrated size of the giant component during an entire attack process. Interestingly, we find that the in-degree and out-degree correlations in each network layer increase the robustness of interdependent degree heterogeneous networks that most real networks are, but decrease the robustness of interdependent networks with homogeneous degree distribution and with strong coupling strengths. Moreover, by applying our theoretical analysis to real interdependent international trade networks, we find that the robustness of these real-world systems increases with the in-degree and out-degree correlations, confirming our theoretical analysis.
| S-EPMC4747761 | biostudies-literature
Project description:Graphlet analysis is part of network theory that does not depend on the choice of the network null model and can provide comprehensive description of the local network structure. Here, we propose a novel method for graphlet-based analysis of directed networks by computing first the signature vector for every vertex in the network and then the graphlet correlation matrix of the network. This analysis has been applied to brain effective connectivity networks by considering both direction and sign (inhibitory or excitatory) of the underlying directed (effective) connectivity. In particular, the signature vectors for brain regions and the graphlet correlation matrices of the brain effective network are computed for 40 healthy subjects and common dependencies are revealed. We found that the signature vectors (node, wedge, and triangle degrees) are dominant for the excitatory effective brain networks. Moreover, by considering only those correlations (or anti correlations) in the correlation matrix that are significant (>0.7 or <-0.7) and are presented in more than 60% of the subjects, we found that excitatory effective brain networks show stronger causal (measured with Granger causality) patterns (G-causes and G-effects) than inhibitory effective brain networks.
| S-EPMC5103263 | biostudies-literature
Project description:We are flooded with large-scale, dynamic, directed, networked data. Analyses requiring exact comparisons between networks are computationally intractable, so new methodologies are sought. To analyse directed networks, we extend graphlets (small induced sub-graphs) and their degrees to directed data. Using these directed graphlets, we generalise state-of-the-art network distance measures (RGF, GDDA and GCD) to directed networks and show their superiority for comparing directed networks. Also, we extend the canonical correlation analysis framework that enables uncovering the relationships between the wiring patterns around nodes in a directed network and their expert annotations. On directed World Trade Networks (WTNs), our methodology allows uncovering the core-broker-periphery structure of the WTN, predicting the economic attributes of a country, such as its gross domestic product, from its wiring patterns in the WTN for up-to ten years in the future. It does so by enabling us to track the dynamics of a country's positioning in the WTN over years. On directed metabolic networks, our framework yields insights into preservation of enzyme function from the network wiring patterns rather than from sequence data. Overall, our methodology enables advanced analyses of directed networked data from any area of science, allowing domain-specific interpretation of a directed network's topology.
| S-EPMC5062067 | biostudies-literature
Project description:Empirical networks often exhibit different meso-scale structures, such as community and core-periphery structures. Core-periphery structure typically consists of a well-connected core and a periphery that is well connected to the core but sparsely connected internally. Most core-periphery studies focus on undirected networks. We propose a generalization of core-periphery structure to directed networks. Our approach yields a family of core-periphery block model formulations in which, contrary to many existing approaches, core and periphery sets are edge-direction dependent. We focus on a particular structure consisting of two core sets and two periphery sets, which we motivate empirically. We propose two measures to assess the statistical significance and quality of our novel structure in empirical data, where one often has no ground truth. To detect core-periphery structure in directed networks, we propose three methods adapted from two approaches in the literature, each with a different trade-off between computational complexity and accuracy. We assess the methods on benchmark networks where our methods match or outperform standard methods from the literature, with a likelihood approach achieving the highest accuracy. Applying our methods to three empirical networks-faculty hiring, a world trade dataset and political blogs-illustrates that our proposed structure provides novel insights in empirical networks.
| S-EPMC7544362 | biostudies-literature
Project description:In weighted graphs the shortest path between two nodes is often reached through an indirect path, out of all possible connections, leading to structural redundancies which play key roles in the dynamics and evolution of complex networks. We have previously developed a parameter-free, algebraically-principled methodology to uncover such redundancy and reveal the distance backbone of weighted graphs, which has been shown to be important in transmission dynamics, inference of important paths, and quantifying the robustness of networks. However, the method was developed for undirected graphs. Here we expand this methodology to weighted directed graphs and study the redundancy and robustness found in nine networks ranging from social, biomedical, and technical systems. We found that similarly to undirected graphs, directed graphs in general also contain a large amount of redundancy, as measured by the size of their (directed) distance backbone. Our methodology adds an additional tool to the principled sparsification of complex networks and the measure of their robustness.
| S-EPMC10619359 | biostudies-literature
Project description:In many real, directed networks, the strongly connected component of nodes which are mutually reachable is very small. This does not fit with current theory, based on random graphs, according to which strong connectivity depends on mean degree and degree-degree correlations. And it has important implications for other properties of real networks and the dynamical behavior of many complex systems. We find that strong connectivity depends crucially on the extent to which the network has an overall direction or hierarchical ordering-a property measured by trophic coherence. Using percolation theory, we find the critical point separating weakly and strongly connected regimes and confirm our results on many real-world networks, including ecological, neural, trade, and social networks. We show that the connectivity structure can be disrupted with minimal effort by a targeted attack on edges which run counter to the overall direction. This means that many dynamical processes on networks can depend significantly on a small fraction of edges.
| S-EPMC10041124 | biostudies-literature
Project description:As the human population increases and production expands, energy demand and anthropogenic carbon emission rates have been growing rapidly, and the need to decrease carbon emission levels has drawn increasing attention. The link between energy production and consumption has required the large-scale transport of energy within energy transmission networks. Within this energy flow, there is a virtual circulation of carbon emissions. To understand this circulation and account for the relationship between energy consumption and carbon emissions, this paper introduces the concept of "carbon emission flow in networks" and establishes a method to calculate carbon emission flow in networks. Using an actual analysis of China's energy pattern, the authors discuss the significance of this new concept, not only as a feasible approach but also as an innovative theoretical perspective.
| S-EPMC3386516 | biostudies-other