Tianle Pu

Ms. Tianle Pu


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 April 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
TPTianle Pu
Tianle Pu
LZLi Zeng
Li Zeng
CCChao Chen
Chao Chen
Network dismantling is one of the most challenging problems in complex systems. This problem encompasses a broad array of practical applications. Previous works mainly focus on the metrics such as the number of nodes in the Giant Connected Component (GCC), average pairwise connectivity, etc. This paper introduces a novel metric, the accumulated 2-core size, for assessing network dismantling. Due to the NP-hard computational complexity of this problem, we propose SmartCore, an end-to-end model for minimizing the accumulated 2-core size by leveraging reinforcement learning and graph neural networks. Extensive experiments across synthetic and real-world datasets demonstrate SmartCore’s superiority over existing methods in terms of both accuracy and speed, suggesting that SmartCore should be a better choice for the network dismantling problem in practice.

6 September 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
SLShixuan Liu
Shixuan Liu
TPTianle Pu
Tianle Pu
LZLi Zeng
Li Zeng
YWYunfei Wang
Yunfei Wang
HCHaoXiang Cheng
HaoXiang Cheng
ZLZhong Liu
Zhong Liu
Tackling the intricacies of network dismantling in complex systems poses significant challenges. This task has relevance across various practical domains, yet traditional approaches focus primarily on singular metrics, such as the number of nodes in the Giant Connected Component (GCC) or the average pairwise connectivity. In contrast, we propose a unique metric that concurrently targets nodes with the highest degree and reduces the GCC size. Given the NP-hard nature of optimizing this metric, we introduce MaxShot, an innovative end-to-end solution that leverages graph representation learning and reinforcement learning. Through comprehensive evaluations on both synthetic and real-world datasets, our method consistently outperforms leading benchmarks in accuracy and efficiency. These results highlight MaxShot’s potential as a superior approach to effectively addressing the network dismantling problem.

20 August 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
SLShixuan Liu
Shixuan Liu
TPTianle Pu
Tianle Pu
LZLi Zeng
Li Zeng
YWYunfei Wang
Yunfei Wang
HCHaoXiang Cheng
HaoXiang Cheng
ZLZhong Liu
Zhong Liu
Tackling the intricacies of network dismantling in complex systems poses significant challenges. This task has relevance across various practical domains, yet traditional approaches focus primarily on singular metrics, such as the number of nodes in the Giant Connected Component (GCC) or average pairwise connectivity. In contrast, we propose a unique metric that concurrently targets nodes with the highest degree and reduces the GCC size. Given the NP-hard nature of optimizing this metric, we introduce MaxShot, an innovative end-to-end solution that leverages graph representation learning and reinforcement learning. Through comprehensive evaluations on both synthetic and real-world datasets, our method consistently outperforms leading benchmarks in accuracy and efficiency. These results highlight MaxShot’s potential as a superior approach to address the network dismantling problem effectively.