Quantifying Node Importance over Network Structural Stability
Fan Zhang, Qingyuan Linghu, Jiadong Xie, Kai Wang, Xuemin Lin, Wenjie Zhang
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Optimizing Network Resilience via Vertex AnchoringSiyi Teng, Jiadong Xie, Fan Zhang, Can Lu 等WWW 2024 · 被引用 5 次
- Enhance Stability of Network by Edge AnchorHongbo Qiu, Renjie Sun, Chen Chen, Xiaoyang WangICDE 2025 · 被引用 1 次
- The k-Trine Cohesive Subgraph and Its Efficient AlgorithmsJinyu Duan, Haicheng Guo, Fan Zhang, Kai Wang 等KDD 2025 · 被引用 1 次
- 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 等CSCW 2026
它引用的顶会 Paper9
- Butterfly-Core Community Search over Labeled GraphsZheng Dong, Xin Huang, Guorui Yuan, Hengshu Zhu 等VLDB 2021 · 被引用 55 次
- Hierarchical Core Maintenance on Large Dynamic GraphsZhe Lin, Fan Zhang, Xuemin Lin, Wenjie Zhang 等VLDB 2021 · 被引用 54 次
- Global Reinforcement of Social Networks: The Anchored Coreness ProblemQingyuan Linghu, Fan Zhang, Xuemin Lin, Wenjie Zhang 等SIGMOD 2020 · 被引用 42 次
- Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic GraphsQing Liu, Xuliang Zhu, Xin Huang, Jianliang XuVLDB 2021 · 被引用 27 次
- An Efficient Algorithm for the Anchored k-Core Budget Minimization ProblemKaixin Liu, Sibo Wang, Yong Zhang, Chunxiao XingICDE 2021 · 被引用 19 次
相关 Paper
- Finer-Grained Engagement in HypergraphsQi Luo, Dongxiao Yu, Yu Liu, Yanwei Zheng 等ICDE 2023 · 被引用 9 次
- Anchored Maximum Communities over Large Directed GraphsYang Huang, Xu Zhou, Yan Ding, Qing Liu 等VLDB 2026
- A Local Search Approach to Efficient (k,p)-Core MaintenanceChenghan Zhang, Yuanyuan Zhu, Lijun ChangSIGMOD 2025 · 被引用 3 次
- Exploring Finer Granularity within the Cores: Efficient (k, p)-Core ComputationChen Zhang, Fan Zhang, Wenjie Zhang, Boge Liu 等ICDE 2020 · 被引用 29 次
- Anchored Vertex Exploration for Community Engagement in Social NetworksTaotao Cai, Jianxin Li, Nur Al Hasan Haldar, Ajmal Mian 等ICDE 2020 · 被引用 13 次
