On the edges' PageRank and line graphs.

Two different approaches on a directed (and possibly weighted) network G are considered in order to define the PageRank of each edge of G with the focus on its applications. It is shown that both approaches are equivalent, even though it is clear that one approach has clear computational advantages over the other. The usefulness of this concept in the context of applications is illustrated by means of some examples within the area of cybersecurity and some simulations and examples within the scope of subway networks.

[1]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Jesús Gómez-Gardeñes,et al.  A mathematical model for networks with structures in the mesoscale , 2010, Int. J. Comput. Math..

[3]  Miguel Romance,et al.  Line graphs for a multiplex network. , 2016, Chaos.

[4]  Tatsuya Akutsu,et al.  Clustering under the line graph transformation: application to reaction network , 2004, BMC Bioinformatics.

[5]  Marián Boguñá,et al.  Approximating PageRank from In-Degree , 2007, WAW.

[6]  Sergio Gómez,et al.  Ranking in interconnected multilayer networks reveals versatile nodes , 2015, Nature Communications.

[7]  Renaud Lambiotte,et al.  Line graphs of weighted networks for overlapping communities , 2010 .

[8]  K-I Goh,et al.  Network robustness of multiplex networks with interlayer degree correlations. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Albert Solé-Ribalta,et al.  Navigability of interconnected networks under random failures , 2013, Proceedings of the National Academy of Sciences.

[10]  Sebastiano Vigna,et al.  PageRank: Functional dependencies , 2009, TOIS.

[11]  Vito Latora,et al.  Structural measures for multiplex networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[13]  Francisco Pedroche,et al.  Sharp estimates for the personalized Multiplex PageRank , 2018, J. Comput. Appl. Math..

[14]  Sybil Derrible,et al.  The complexity and robustness of metro networks , 2010 .

[15]  V. Latora,et al.  The Network Analysis of Urban Streets: A Primal Approach , 2006 .

[16]  Francesco Romani,et al.  A multi-class approach for ranking graph nodes: Models and experiments with incomplete data , 2015, Inf. Sci..

[17]  Yamir Moreno,et al.  Dimensionality reduction and spectral properties of multiplex networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Miguel Romance,et al.  Structural properties of the line-graphs associated to directed networks , 2012, Networks Heterog. Media.

[19]  Sergio Gómez,et al.  Random walk centrality in interconnected multilayer networks , 2015, ArXiv.

[20]  Gilbert Laporte,et al.  Transferability of collective transportation line networks from a topological and passenger demand perspective , 2015, Networks Heterog. Media.

[21]  Francisco Pedroche,et al.  A biplex approach to PageRank centrality: From classic to multiplex networks. , 2016, Chaos.

[22]  Krzysztof Kulakowski,et al.  Clustering in random line graphs , 2009, Comput. Phys. Commun..

[23]  J. C. Nacher,et al.  Two complementary representations of a scale-free network , 2005 .

[24]  R. CRIADO,et al.  Hyperstructures, a New Approach to Complex Systems , 2010, Int. J. Bifurc. Chaos.

[25]  REGINO CRIADO,et al.  A Post-Processing Method for Interest Point Location in Images by Using Weighted Line-Graph Complex Networks , 2012, Int. J. Bifurc. Chaos.

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

[27]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[28]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[29]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[30]  Rui Jiang,et al.  Urban traffic simulated from the dual representation: Flow, crisis and congestion , 2009 .

[31]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[32]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[33]  Miguel Romance,et al.  Centralities of a network and its line graph: an analytical comparison by means of their irregularity , 2014, Int. J. Comput. Math..

[34]  K-I Goh,et al.  Multiplexity-facilitated cascades in networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Ernesto Estrada,et al.  Extension of Edge Connectivity Index. Relationships to Line Graph Indices and QSPR Applications , 1998, J. Chem. Inf. Comput. Sci..

[36]  Alicia De-Los-Santos,et al.  Analyzing connectivity in collective transportation line networks by means of hypergraphs , 2013 .

[37]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[38]  Bill Hillier,et al.  The Hidden Geometry of Deformed Grids: Or, Why Space Syntax Works, When it Looks as Though it Shouldn't , 1999 .

[39]  F. Pedroche,et al.  MÉTODOS DE CÁLCULO DEL VECTOR PAGERANK , 2008 .

[40]  Ginestra Bianconi,et al.  Multiplex PageRank , 2013, PloS one.

[41]  Francisco Pedroche,et al.  On the Localization of the Personalized PageRank of Complex Networks , 2012, ArXiv.

[42]  Luis Mario Floría,et al.  Evolution of Cooperation in Multiplex Networks , 2012, Scientific Reports.

[43]  Miguel Romance,et al.  Analytical relationships between metric and centrality measures of a network and its dual , 2011, J. Comput. Appl. Math..

[44]  V. Latora,et al.  Centrality in networks of urban streets. , 2006, Chaos.

[45]  M. Aigner.  On the linegraph of a directed graph , 1967 .

[46]  Jay Bagga.  Old and new generalizations of line graphs , 2004, Int. J. Math. Math. Sci..

[47]  Stefano Boccaletti,et al.  Vulnerability and Fall of Efficiency in Complex Networks: a New Approach with Computational Advantages , 2009, Int. J. Bifurc. Chaos.

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

[49]  Philippe G. H. Lehot.  An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[50]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[51]  J. Anez,et al.  Dual graph representation of transport networks , 1996 .

[52]  Miguel Romance,et al.  Efficient algorithms for estimating loss of information in a complex network: Applications to intentional risk analysis , 2015, Networks Heterog. Media.

[53]  Daniele Vilone,et al.  Evolutionary Games defined at the Network Mesoscale: The Public Goods game , 2010, Chaos.

[54]  A. J. Hoffman,et al.  ON THE LINE GRAPH OF A SYMMETRIC BALANCED INCOMPLETE BLOCK DESIGN , 1965 .

[55]  Jürgen Kurths,et al.  Investigating the topology of interacting networks , 2011, 1102.3067.

[56]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[57]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.