PageRank for Edges: Axiomatic Characterization
Natalia Kucharczuk, Tomasz Was, Oskar Skibski
Abstract
Edge centrality measures are functions that evaluate the importance of edges in a network. They can be used to assess the role of a backlink for the popularity of a website as well as the importance of a flight in virus spreading. Various node centralities have been translated to apply for edges, including Edge Betweenness, Eigenedge (edge version of eigenvector centrality), and Edge PageRank. With this paper, we initiate the discussion on the axiomatic properties of edge centrality measures. We do it by proposing an axiomatic characterization of Edge PageRank. Our characterization is the first characterization of any edge centrality measures in the literature.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itRelated papers
- Scalable Algorithms for Forest-Based Centrality on Large GraphsYubo Sun, Haoxin Sun, Zhongzhi ZhangWWW 2025
- SimEdge: A Scalable Transitivity-Aware Graph-Theoretic Similarity Model for Capturing Edge-to-Edge RelationshipsWeiren YuWWW 2025 · 1 citation
- Temporal Walk Centrality: Ranking Nodes in Evolving NetworksLutz Oettershagen, Petra Mutzel, Nils M. KriegeWWW 2022 · 25 citations
- Algorithmic Aspects of Temporal BetweennessSebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej RymarKDD 2020 · 31 citations
- Efficient Betweenness Centrality Computation over Large Heterogeneous Information NetworksXinrui Wang, Yiran Wang, Xuemin Lin, Jeffrey Xu Yu et al.VLDB 2024 · 4 citations
