A bag-of-paths node criticality measure

This work compares several node (and network) criticality measures quantifying to which extend each node is critical with respect to the communication flow between nodes of the network, and introduces a new measure based on the Bag-of-Paths (BoP) framework. Network disconnection simulation experiments show that the new BoP measure outperforms all the other measures on a sample of Erdos-Renyi and Albert-Barabasi graphs. Furthermore, a faster (still O(n^3)), approximate, BoP criticality relying on the Sherman-Morrison rank-one update of a matrix is introduced for tackling larger networks. This approximate measure shows similar performances as the original, exact, one.

[1]  M. Randic,et al.  Resistance distance , 1993 .

[2]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[3]  Ernesto Estrada,et al.  Communicability betweenness in complex networks , 2009, 0905.4102.

[4]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[7]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[8]  George A. F. Seber,et al.  A matrix handbook for statisticians , 2007 .

[9]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[10]  Christos Faloutsos,et al.  On the Vulnerability of Large Graphs , 2010, 2010 IEEE International Conference on Data Mining.

[11]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[12]  Marco Saerens,et al.  Algorithms and Models for Network Data and Link Analysis , 2016 .

[13]  Enrico Bozzo,et al.  Resistance distance, closeness, and betweenness , 2013, Soc. Networks.

[14]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[15]  Douglas J. Klein,et al.  Centrality measure in graphs , 2010 .

[16]  Ulrik Brandes,et al.  Centrality Measures Based on Current Flow , 2005, STACS.

[17]  Kevin Françoisse,et al.  A bag-of-paths framework for network data analysis , 2013, Neural Networks.

[18]  Jari Saramäki,et al.  Two betweenness centrality measures based on Randomized Shortest Paths , 2015, Scientific Reports.

[19]  Alan D. Taylor,et al.  Mathematics and politics : strategy, voting, power and proof , 1997 .

[20]  Kevin Françoisse,et al.  The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  J. H. Ward.  Hierarchical Grouping to Optimize an Objective Function , 1963 .

[22]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Marco Saerens,et al.  Random walks based modularity: application to semi-supervised learning , 2014, WWW.

[24]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[25]  Ulrike von Luxburg,et al.  Hitting and commute times in large random neighborhood graphs , 2014, J. Mach. Learn. Res..

[26]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[27]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[28]  Kevin Françoisse,et al.  Semisupervised Classification Through the Bag-of-Paths Group Betweenness , 2012, IEEE Transactions on Neural Networks and Learning Systems.

[29]  Ali Tizghadam,et al.  Betweenness centrality and resistance distance in communication networks , 2010, IEEE Network.

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

[31]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[32]  Béla Bollobás,et al.  Random Graphs , 1985 .

[33]  Gene H. Golub,et al.  Matrix computations , 1983 .

[34]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[35]  Peter G. Doyle,et al.  The Kemeny constant of a Markov chain , 2009, 0909.2636.

[36]  François Fouss,et al.  Randomized Shortest-Path Problems: Two Related Models , 2009, Neural Computation.

[37]  Ljupco Kocarev,et al.  Application of modal analysis in assessing attack vulnerability of complex networks , 2010 .

[38]  Rosa M. Benito,et al.  Robustness of heterogeneous complex networks , 2009 .

[39]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[40]  Artur Ziviani,et al.  Distributed location of the critical nodes to network robustness based on spectral analysis , 2011, 2011 7th Latin American Network Operations and Management Symposium.

[41]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[42]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[43]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[44]  Ernesto Estrada,et al.  Network robustness to targeted attacks. The interplay of expansibility and degree distribution , 2006 .

[45]  U. V. Luxburg,et al.  Getting lost in space: large sample analysis of the commute distance , 2010, NIPS 2010.