Efficient Identification of Critical Links Based on Reachability Under the Presence of Time Constraint

In this paper, we focus on an emergency situation in the real-world such as disaster evacuation and propose an algorithm that can efficiently identify critical links in a spatial network that substantially degrade network performance if they fail to function. For that purpose, we quantify the network performance by node reachability from/to one of target facilities within the prespecified time limitation, which corresponds to the number of people who can safely evacuate in a disaster. Using a real-world road network and geographical information of actual facilities, we demonstrated that the proposed method is much more efficient than the method based on the betweenness centrality that is one of the representative centrality measures and that the critical links detected by our method cannot be identified by using a straightforward extension of the betweenness centrality.

[1]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

[2]  Alessandro Vespignani,et al.  The Structure of Interurban Traffic: A Weighted Network Analysis , 2005, physics/0507106.

[3]  Masahiro Kimura,et al.  Accurate and efficient detection of critical links in network to minimize information loss , 2018, Journal of Intelligent Information Systems.

[4]  Licinio da Silva Portugal,et al.  Determining Critical Links in a Road Network: Vulnerability and Congestion Indicators☆ , 2014 .

[5]  Masahiro Kimura,et al.  Accelerating Computation of Distance Based Centrality Measures for Spatial Networks , 2016, DS.

[6]  Tao Mei,et al.  Shop-Type Recommendation Leveraging the Data from Social Media and Location-Based Services , 2016, ACM Trans. Knowl. Discov. Data.

[7]  Enrico Zio,et al.  Comparing Network-Centric and Power Flow Models for the Optimal Allocation of Link Capacities in a Cascade-Resilient Power Transmission Network , 2017, IEEE Systems Journal.

[8]  V. Latora,et al.  Centrality measures in spatial networks of urban streets. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Nam P. Nguyen,et al.  On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability , 2013, IEEE/ACM Transactions on Networking.

[10]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[11]  Robert E. Tarjan,et al.  A Note on Finding the Bridges of a Graph , 1974, Inf. Process. Lett..

[12]  Masahiro Kimura,et al.  Blocking links to minimize contamination spread in a social network , 2009, TKDD.

[13]  Masahiro Kimura,et al.  Maximizing Network Performance Based on Group Centrality by Creating Most Effective k-Links , 2017, 2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[14]  Albert-Lszl Barabsi,et al.  Network Science , 2016, Encyclopedia of Big Data.

[15]  Orhan Dagdeviren,et al.  Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks , 2013, Sensors.

[16]  M. Prokopenko,et al.  Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks , 2013, PloS one.

[17]  Christian Thiemann,et al.  Robust classification of salient links in complex networks. , 2012, Nature communications.

[18]  Ümit V. Çatalyürek,et al.  Graph Manipulations for Fast Centrality Computation , 2017, ACM Trans. Knowl. Discov. Data.

[19]  Mark Stoneking,et al.  Correction: Corrigendum: Larger mitochondrial DNA than Y-chromosome differences between matrilocal and patrilocal groups from Sumatra , 2012 .

[20]  Alexandre M. Bayen,et al.  Understanding Road Usage Patterns in Urban Areas , 2012, Scientific Reports.

[21]  Alper Yilmaz,et al.  A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS , 2010 .

[22]  Masahiro Kimura,et al.  Efficient Detection of Critical Links to Maintain Performance of Network with Uncertain Connectivity , 2018, PRICAI.