30 citations · 53 across the 17 of their papers we have counts for
8 papers · 1 filter
FS_GPlib: Breaking the Web-Scale Barrier - A Unified Acceleration Framework for Graph Propagation Models
Chang Guo, Juyuan Zhang, Chang Su +2
Propagation models are essential for modeling and simulating dynamic processes such as epidemics and information diffusion. However, existing tools struggle to scale to large-scale…
Structure-Aware Optimal Intervention for Rumor Dynamics on Networks: Node-Level, Time-Varying, and Resource-Constrained
Yan Zhu, Qingyang Liu, Chang Guo +2
Rumor propagation in social networks undermines social stability and public trust, calling for interventions that are both effective and resource-efficient. We develop a node-level…
Deterministic Frequency--Domain Inference of Network Topology and Hidden Components via Structure--Behavior Scaling
Xiaoxiao Liang, Tianlong Fan, Linyuan Lü
Hidden interactions and components in complex systems-ranging from covert actors in terrorist networks to unobserved brain regions and molecular regulators-often manifest only thro…
Weighted cycle-based identification of influential node groups in complex networks
Wenxin Zheng, Wenfeng Shi, Tianlong Fan +1
Identifying influential node groups in complex networks is crucial for optimizing information dissemination, epidemic control, and viral marketing. However, traditional centrality-…
Modeling Emotional Dynamics in Social Networks: Uncovering the Positive Role of Information Cocoons in Group Emotional Stabilization
Jinhu Ren, Xifei Fu, Tianlong Fan +1
Information cocooning-amplified by algorithmic filtering-poses complex challenges for emotional dynamics in online social networks. This study explores how algorithmically reinforc…
A universal optimization framework based on cycle ranking for influence maximization in complex networks
Wenfeng Shi, Tianlong Fan, Shuqi Xu +2
Influence maximization aims to identify a set of influential individuals, referred to as influencers, as information sources to maximize the spread of information within networks,…
A Fast Maximum Clique Algorithm Based on Network Decomposition for Large Sparse Networks
Tianlong Fan, Wenjun Jiang, Yi-Cheng Zhang +1
Finding maximum cliques in large networks is a challenging combinatorial problem with many real-world applications. We present a fast algorithm to achieve the exact solution for th…
A Quick Framework for Evaluating Worst Robustness of Complex Networks
Wenjun Jiang, Peiyan Li, Tianlong Fan +4
Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks, with simulation attacks being the prevailing evaluation method. Simulation attacks are…