PageRank for Edges: Axiomatic Characterization
Natalia Kucharczuk, Tomasz Was, Oskar Skibski
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- 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 次
- Temporal Walk Centrality: Ranking Nodes in Evolving NetworksLutz Oettershagen, Petra Mutzel, Nils M. KriegeWWW 2022 · 被引用 25 次
- Algorithmic Aspects of Temporal BetweennessSebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej RymarKDD 2020 · 被引用 31 次
- Efficient Betweenness Centrality Computation over Large Heterogeneous Information NetworksXinrui Wang, Yiran Wang, Xuemin Lin, Jeffrey Xu Yu 等VLDB 2024 · 被引用 4 次
