A Graph Resilience Metric Based On Paths: Higher Order Analytics With GPU

Structural resilience is an inherent, paramount property of real world, massive, scale free graphs such as those typically encountered in brain networks, protein-to-protein interaction diagrams, logistics and supply chains, as well as social media among others. This means that in case a small fraction of edges or even vertices with their incident edges are deleted, then alternative, although possibly longer, paths can be found such that the overall graph connectivity remains intact. This durability, which is constantly exhibited in nature, can be attributed to three main reasons. First, almost by construction, scale free graphs have a relatively high density. Moreover, they have a short diameter or at least an effective diameter. Finally, scale free graphs are recursively built on communities. As a consequence, the effect of a few edge or even vertex deletions inside a community remains isolated there as a rule and the effects of deletion are thus negated. Ultimately these properties stem from the degree distribution. In this conference paper is proposed a new, generic, and scalable graph resilience metric which relies on the weighted sum of the number of paths crossing certain vertices of great communication and structural value. Finally, the CUDA implementation is discussed and compared to a serial one in mex. The metric performance is assessed in terms of total computational time and parallelism.

[1]  Joseph E. Gonzalez,et al.  GraphLab: A New Parallel Framework for Machine Learning , 2010 .

[2]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[3]  Razvan Pascanu,et al.  Theano: new features and speed improvements , 2012, ArXiv.

[4]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[5]  Spyros Sioutas,et al.  Defining and evaluating Twitter influence metrics: a higher-order approach in Neo4j , 2017, Social Network Analysis and Mining.

[6]  Andrew S. Grimshaw,et al.  Scalable GPU graph traversal , 2012, PPoPP '12.

[7]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[8]  O. Sporns,et al.  Complex brain networks: graph theoretical analysis of structural and functional systems , 2009, Nature Reviews Neuroscience.

[9]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[10]  Cornelis J Stam,et al.  Graph theoretical analysis of complex networks in the brain , 2007, Nonlinear biomedical physics.

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

[12]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[13]  M. Benzi,et al.  Quadrature rule-based bounds for functions of adjacency matrices , 2010 .

[14]  John Salvatier,et al.  Theano: A Python framework for fast computation of mathematical expressions , 2016, ArXiv.

[15]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[17]  Christos Makris,et al.  Eventually consistent cardinality estimation with applications in biodata mining , 2016, SAC.

[18]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[19]  Athanasios K. Tsakalidis,et al.  Graph Community Discovery Algorithms in Neo4j with a Regularization-based Evaluation Metric , 2017, WEBIST.

[20]  John Scott.  Social Network Analysis , 1988 .

[21]  Stéphane Bressan,et al.  Fast random graph generation , 2011, EDBT/ICDT '11.

[22]  Eugene Agichtein,et al.  Discovering authorities in question answer communities by using link analysis , 2007, CIKM '07.

[23]  Qi He,et al.  TwitterRank: finding topic-sensitive influential twitterers , 2010, WSDM '10.

[24]  Georgios Drakopoulos,et al.  A Space Efficient Scheme for Persistent Graph Representation , 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.

[25]  Dingwei Wang,et al.  Resilience and Friability of Transportation Networks: Evaluation, Analysis and Optimization , 2011, IEEE Systems Journal.

[26]  Susann C. Allmaier,et al.  Parallel Graph Generation Algorithms for Shared and Distributed Memory Machines , 1997, PARCO.

[27]  Phillip Bonacich,et al.  Eigenvector-like measures of centrality for asymmetric relations , 2001, Soc. Networks.

[28]  Mark T. Jones,et al.  A Parallel Graph Coloring Heuristic , 1993, SIAM J. Sci. Comput..

[29]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[30]  Tinkara Toš,et al.  Graph Algorithms in the Language of Linear Algebra , 2012, Software, environments, tools.

[31]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[32]  Luciano Rossoni,et al.  Models and methods in social network analysis , 2006 .

[33]  David Hutchison,et al.  Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines , 2010, Comput. Networks.

[34]  Athanasios K. Tsakalidis,et al.  A Neo4j Implementation of Fuzzy Random Walkers , 2016, SETN.

[35]  Desmond J. Higham,et al.  Network Properties Revealed through Matrix Functions , 2010, SIAM Rev..

[36]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[37]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[38]  Benny Sudakov,et al.  Local resilience of graphs , 2007, Random Struct. Algorithms.

[39]  Athanasios K. Tsakalidis,et al.  Evaluating Twitter Influence Ranking with System Theory , 2016, WEBIST.

[40]  Mason A. Porter,et al.  Dynamic network centrality summarizes learning in the human brain , 2012, J. Complex Networks.