Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach
Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph,
and it finds applications in various domains including graph clustering, recommendation …
and it finds applications in various domains including graph clustering, recommendation …
Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks
In recent years, graph neural networks (GNNs) have emerged as a potent tool for learning
on graph-structured data and won fruitful successes in varied fields. The majority of GNNs …
on graph-structured data and won fruitful successes in varied fields. The majority of GNNs …
Efficient Approximation of Kemeny's Constant for Large Graphs
H Xia, Z Zhang - Proceedings of the ACM on Management of Data, 2024 - dl.acm.org
For an undirected graph, its Kemeny's constant is defined as the mean hitting time of random
walks from one vertex to another chosen randomly according to the stationary distribution …
walks from one vertex to another chosen randomly according to the stationary distribution …
Approximating Spanning Centrality with Random Bouquets
Spanning Centrality is a measure used in network analysis to determine the importance of
an edge in a graph based on its contribution to the connectivity of the entire network …
an edge in a graph based on its contribution to the connectivity of the entire network …