Residual closeness in networks
نویسنده
چکیده
A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered—vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability—it captures the result of actions even if they are small enough not to disconnect the graph. A definition for closeness is modified so it still can be used for unconnected graphs but the calculations are easier. r 2006 Elsevier B.V. All rights reserved. PACS: 89.75.Fb; 87.23.Ge; 89.65. s
منابع مشابه
A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملPredicting Citywide Crowd Flows Using Deep Spatio-Temporal Residual Networks
Forecasting the flow of crowds is of great importance to traffic management and public safety, and very challenging as it is affected by many complex factors, including spatial dependencies (nearby and distant), temporal dependencies (closeness, period, trend), and external conditions (e.g. weather and events). We propose a deep-learning-based approach, called ST-ResNet, to collectively forecas...
متن کاملRelationship between Turbidity and Residual Chlorine and Microbial Quality of Drinking Water
Abstract Background and Objective: Safe drinking water is essential for health and health promotion is dependent on providing safe water. We aimed to determine the relationship between turbidity & residual chlorine and microbial quality of drinking water in Agh ghala. Material and Methods: In this descriptive-analytical study, 2079 water samples were collected from water networks of 78 ...
متن کاملComputing Top-k Closeness Centrality in Fully-dynamic Graphs
Closeness is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However, for many applications, it is only necessary to find the k most central nodes and not all closeness values. Prior work has shown that computing the top-k nodes with highest closeness can be done much faster than comput...
متن کاملDeep Spatio-Temporal Residual Networks for Citywide Crowd Flows Prediction
Forecasting the flow of crowds is of great importance to traffic management and public safety, and very challenging as it is affected by many complex factors, such as inter-region traffic, events, and weather. We propose a deep-learning-based approach, called ST-ResNet, to collectively forecast the inflow and outflow of crowds in each and every region of a city. We design an end-to-end structur...
متن کامل