TopoBudget: Persistent-Connectivity-Preserving Web Graph Sparsification for Reusable Community Analytics
Existing graph sparsification methods struggle to preserve multiscale connectivity structures under edge relevance filtering, often discarding topological evidence critical for community detection. This work proposes a persistence-aware sparsification approach that, given an edge relevance filtration and a proxy partition, selects a budget-constrained subgraph via constrained greedy submodular optimization to exactly maintain connected components across all filtration thresholds—thereby achieving, for the first time, complete preservation of the zeroth-dimensional persistent diagram with a theoretical $(1 - 1/e)$ approximation guarantee. The method integrates a persistent homology skeleton, a skeleton-constrained monotone submodular objective, and a degree-balanced recovery strategy. Experiments on six real-world web and social graphs demonstrate that TopoBudget achieves state-of-the-art community preservation under Louvain, competitive performance under Infomap, zero topological mismatch, and significantly faster runtime than effective-resistance baselines.