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.

• Publication year

  2018

• Venue

  Chaos

• Publication date

  2018-07-01

• Fields of study

  Medicine, Computer Science

• Identifiers
  DOI 10.1063/1.5020127PMID 30070492
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Sharp estimates for the personalized Multiplex PageRank

  2018cited by this paper
• Network Science

  2017cited by this paper
• A biplex approach to PageRank centrality: From classic to multiplex networks.

  2016cited by this paper
• Line graphs for a multiplex network.

  2016cited by this paper
• Intentional Risk Management through Complex Networks Analysis

  2015cited by this paper
• Random walk centrality in interconnected multilayer networks

  2015cited by this paper
• Transferability of collective transportation line networks from a topological and passenger demand perspective

  2015cited by this paper
• Efficient algorithms for estimating loss of information in a complex network: Applications to intentional risk analysis

  2015cited by this paper
• A multi-class approach for ranking graph nodes: Models and experiments with incomplete data

  2015cited by this paper
• The structure and dynamics of multilayer networks

  2014cited by this paper
• Centralities of a network and its line graph: an analytical comparison by means of their irregularity

  2014cited by this paper
• Structural measures for multiplex networks.

  2013cited by this paper
• Ranking in interconnected multilayer networks reveals versatile nodes

  2013cited by this paper
• Random Walks on Multiplex Networks

  2013cited by this paper
• Multilayer networks

  2013cited by this paper
• Network robustness of multiplex networks with interlayer degree correlations.

  2013cited by this paper
• Multiplex PageRank

  2013cited by this paper
• Dimensionality reduction and spectral properties of multiplex networks

  2013cited by this paper
• Navigability of interconnected networks under random failures

  2013cited by this paper
• Analyzing connectivity in collective transportation line networks by means of hypergraphs

  2013cited by this paper
• A Post-Processing Method for Interest Point Location in Images by Using Weighted Line-Graph Complex Networks

  2012cited by this paper
• On the Localization of the Personalized PageRank of Complex Networks

  2012cited by this paper
• Structural properties of the line-graphs associated to directed networks

  2012cited by this paper
• Evolution of Cooperation in Multiplex Networks

  2012cited by this paper
• Investigating the topology of interacting networks

  2011cited by this paper
• Analytical relationships between metric and centrality measures of a network and its dual

  2011cited by this paper
• Multiplexity-facilitated cascades in networks.

  2011cited by this paper
• The complexity and robustness of metro networks

  2010cited by this paper
• A mathematical model for networks with structures in the mesoscale

  2010cited by this paper
• Evolutionary Games defined at the Network Mesoscale: The Public Goods game

  2010cited by this paper
• Networks: An Introduction

  2010cited by this paper
• Hyperstructures, a New Approach to Complex Systems

  2010cited by this paper
• Line graphs of weighted networks for overlapping communities

  2009cited by this paper
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks

  2009cited by this paper
• Clustering in random line graphs

  2009cited by this paper
• Vulnerability and Fall of Efficiency in Complex Networks: a New Approach with Computational Advantages

  2009cited by this paper
• PageRank: Functional dependencies

  2009cited by this paper
• Line graphs, link partitions, and overlapping communities.

  2009cited by this paper
• Catastrophic cascade of failures in interdependent networks

  2009cited by this paper
• Urban traffic simulated from the dual representation: Flow, crisis and congestion

  2009cited by this paper
• Approximating PageRank from In-Degree

  2007cited by this paper
• Google's PageRank and Beyond

  2007cited by this paper
• Centrality in networks of urban streets.

  2006cited by this paper
• Complex networks: Structure and dynamics

  2006cited by this paper
• Centrality measures in spatial networks of urban streets.

  2005cited by this paper
• Two complementary representations of a scale-free network

  2004cited by this paper
• Old and new generalizations of line graphs

  2004cited by this paper
• Clustering under the line graph transformation: application to reaction network

  2004cited by this paper
• The Structure and Function of Complex Networks

  2003cited by this paper
• Efficient behavior of small-world networks.

  2001cited by this paper
• Statistical mechanics of complex networks

  2001cited by this paper
• Exploring complex networks

  2001cited by this paper
• Matrix Analysis and Applied Linear Algebra

  2000cited by this paper
• The Hidden Geometry of Deformed Grids: Or, Why Space Syntax Works, When it Looks as Though it Shouldn't

  1999cited by this paper
• Extension of Edge Connectivity Index. Relationships to Line Graph Indices and QSPR Applications

  1998cited by this paper
• The Anatomy of a Large-Scale Hypertextual Web Search Engine

  1998cited by this paper
• Dual graph representation of transport networks

  1996cited by this paper
• Social Network Analysis: Methods and Applications

  1994cited by this paper
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph

  1974cited by this paper
• On the linegraph of a directed graph

  1967cited by this paper
• ON THE LINE GRAPH OF A SYMMETRIC BALANCED INCOMPLETE BLOCK DESIGN

  1965cited by this paper
• Congruent Graphs and the Connectivity of Graphs

  1932cited by this paper

• Matrix-based pagerank control in hypergraphs for semantic text summaries

  2025cites this paper
• Fixed points of Personalized PageRank centrality: From irreducible to reducible networks

  2025cites this paper
• A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries

  2023cites this paper
• Increasing the Effectiveness of Network Intrusion Detection Systems (NIDSs) by Using Multiplex Networks and Visibility Graphs

  2022cites this paper
• PageRank for Edges: Axiomatic Characterization

  2021cites this paper
• Enriched line graph: A new structure for searching language collocations

  2020cites this paper
• On PageRank versatility for multiplex networks: properties and some useful bounds

  2020cites this paper
• Using complex networks to identify patterns in specialty mathematical language: a new approach

  2020cites this paper
• Influential Node Identification in Command and Control Networks Based on Integral k-Shell

  2019cites this paper
• Non-backtracking PageRank: From the classic model to hashimoto matrices

  2019cites this paper
• Introduction to Focus Issue: Nonlinear dynamics of non-equilibrium complex systems.

  2018cites this paper