Accelerating Spanning-Centrality Approximation with Sampling-Aware Vectorized Random Walks

Gökhan Göktürk, Kamer Kaya

Spanning centrality quantifies an edge's importance through its share of a graph's spanning trees, and approximating it for all edges (AESC) requires processing large volumes of ir…