Quantifying Node Importance over Network Structural Stability
Fan Zhang, Qingyuan Linghu, Jiadong Xie, Kai Wang, Xuemin Lin, Wenjie Zhang
Abstract
Quantifying node importance on engagement dynamics is critical to support network stability. We can motivate or retain the users in a social platform according to their importance s.t. the network is more sustainable. Existing studies validate that the coreness of a node is the "best practice" on network topology to estimate the engagement of the node. In this paper, the importance of a node is the effect on the engagement of other nodes when its engagement is strengthened or weakened. Specifically, the importance of a node is quantified via two novel concepts: the anchor power to measure the engagement effect of node strengthening (i.e., the overall coreness gain) and the collapse power to measure the engagement effect of node weakening (i.e., the overall coreness loss). We find the computation of the two concepts can be naturally integrated into a shell component-based framework, and propose a unified static algorithm to compute both the anchored and collapsed followers. For evolving networks, efficient maintenance techniques are designed to update the follower sets of each node, which is faster than redoing the static algorithm by around 3 orders of magnitude. Extensive experiments on real-life data demonstrate the effectiveness of our model and the efficiency of our algorithms.
• Theory of computation → Graph algorithms analysis.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 537b493e-6c5a-4cd0-b223-c9a26c2321e1Cited by top-tier papers6
- Optimizing Network Resilience via Vertex AnchoringSiyi Teng, Jiadong Xie, Fan Zhang, Can Lu et al.WWW 2024 · 5 citations
- Enhance Stability of Network by Edge AnchorHongbo Qiu, Renjie Sun, Chen Chen, Xiaoyang WangICDE 2025 · 1 citation
- The k-Trine Cohesive Subgraph and Its Efficient AlgorithmsJinyu Duan, Haicheng Guo, Fan Zhang, Kai Wang et al.KDD 2025 · 1 citation
- Learning to Compress Graphs via Dual Agents for Consistent Topological Robustness EvaluationQisen Chai, Yansong Wang, Junjie Huang, Tao JiaAAAI 2026
- Characterizing an LLM-driven Social Network: The Case of Chirper.aiYiming Zhu, Yupeng He, Ehsan-Ul Haq, Gareth Tyson et al.CSCW 2026
Builds on9
- Butterfly-Core Community Search over Labeled GraphsZheng Dong, Xin Huang, Guorui Yuan, Hengshu Zhu et al.VLDB 2021 · 55 citations
- Hierarchical Core Maintenance on Large Dynamic GraphsZhe Lin, Fan Zhang, Xuemin Lin, Wenjie Zhang et al.VLDB 2021 · 54 citations
- Global Reinforcement of Social Networks: The Anchored Coreness ProblemQingyuan Linghu, Fan Zhang, Xuemin Lin, Wenjie Zhang et al.SIGMOD 2020 · 42 citations
- Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic GraphsQing Liu, Xuliang Zhu, Xin Huang, Jianliang XuVLDB 2021 · 27 citations
- An Efficient Algorithm for the Anchored k-Core Budget Minimization ProblemKaixin Liu, Sibo Wang, Yong Zhang, Chunxiao XingICDE 2021 · 19 citations
Related papers
- Finer-Grained Engagement in HypergraphsQi Luo, Dongxiao Yu, Yu Liu, Yanwei Zheng et al.ICDE 2023 · 9 citations
- Anchored Maximum Communities over Large Directed GraphsYang Huang, Xu Zhou, Yan Ding, Qing Liu et al.VLDB 2026
- A Local Search Approach to Efficient (k,p)-Core MaintenanceChenghan Zhang, Yuanyuan Zhu, Lijun ChangSIGMOD 2025 · 3 citations
- Exploring Finer Granularity within the Cores: Efficient (k, p)-Core ComputationChen Zhang, Fan Zhang, Wenjie Zhang, Boge Liu et al.ICDE 2020 · 29 citations
- Anchored Vertex Exploration for Community Engagement in Social NetworksTaotao Cai, Jianxin Li, Nur Al Hasan Haldar, Ajmal Mian et al.ICDE 2020 · 13 citations
