Fast Maximization of Current Flow Group Closeness Centrality
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908304311058432 |
|---|---|
| author | Xia, Haisong Zhang, Zhongzhi |
| author_facet | Xia, Haisong Zhang, Zhongzhi |
| contents | Derived from effective resistances, the current flow closeness centrality (CFCC) for a group of nodes measures the importance of node groups in an undirected graph with $n$ nodes. Given the widespread applications of identifying crucial nodes, we investigate the problem of maximizing CFCC for a node group $S$ subject to the cardinality constraint $|S|=k\ll n$. Despite the proven NP-hardness of this problem, we propose two novel greedy algorithms for its solution. Our algorithms are based on spanning forest sampling and Schur complement, which exhibit nearly linear time complexities and achieve an approximation factor of $1-\frac{k}{k-1}\frac{1}{\mathrm{e}}-ε$ for any $0<ε<1$. Extensive experiments on real-world graphs illustrate that our algorithms outperform the state-of-the-art method in terms of efficiency and effectiveness, scaling to graphs with millions of nodes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_04472 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast Maximization of Current Flow Group Closeness Centrality Xia, Haisong Zhang, Zhongzhi Social and Information Networks Derived from effective resistances, the current flow closeness centrality (CFCC) for a group of nodes measures the importance of node groups in an undirected graph with $n$ nodes. Given the widespread applications of identifying crucial nodes, we investigate the problem of maximizing CFCC for a node group $S$ subject to the cardinality constraint $|S|=k\ll n$. Despite the proven NP-hardness of this problem, we propose two novel greedy algorithms for its solution. Our algorithms are based on spanning forest sampling and Schur complement, which exhibit nearly linear time complexities and achieve an approximation factor of $1-\frac{k}{k-1}\frac{1}{\mathrm{e}}-ε$ for any $0<ε<1$. Extensive experiments on real-world graphs illustrate that our algorithms outperform the state-of-the-art method in terms of efficiency and effectiveness, scaling to graphs with millions of nodes. |
| title | Fast Maximization of Current Flow Group Closeness Centrality |
| topic | Social and Information Networks |
| url | https://arxiv.org/abs/2504.04472 |