Chang Su
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chang Su has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Linyuan Lü
University of Science and Technology of China
3 shared publications - Shi-Min Cai
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2 shared publications - Chang Guo
School of Cyber Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
1 shared publication Chunzi Li
Hangzhou Normal Univ, Lib Hangzhou Normal Univ, Hangzhou 311121, Peoples R China
1 shared publication- Fang Zhou
Hangzhou Innovation Institute, Beihang University, Hangzhou, P. R. China
1 shared publication - Junying Cui
Department of Physics, University of Fribourg, 1700 Fribourg, Switzerland
1 shared publication
Latest Publications
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 4623-4634
FS_GPlib: Breaking the Web-Scale Barrier — A Unified Acceleration Framework for Graph Propagation Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 4623-4634
Open AccessFS_GPlib: Breaking the Web-Scale Barrier — A Unified Acceleration Framework for Graph Propagation Models
- Open Access
The Synergistic Effects of Structural Evolution and Attack Strategies on Network Matching Robustness
Research on network robustness has long focused on changes in the structure connectivity of networks under attacks, effectively depicting structural integrity while ignoring the exploration of functional integrity. When the core path of the network is attacked, even if it remains connected, the rapid increase in energy consumption may still trigger systematic risks. Existing studies mainly use random networks and scale-free networks as comparative models, which has become a classic research paradigm. However, real-world networks often exhibit mixed topological features. To address the above issues, this paper introduces the concept of energy from physics into bipartite networks and establishes an evaluation framework for assessing the synergistic effects of structural evolution and attack strategies on network matching robustness. We first introduce a structural parameter u to construct a structural evolution model, where the network’s minimal matching energy distribution evolves from topological heterogeneity to random features. When u approaches 0, edges with the minimal matching energy concentrate on a few candidates, manifesting scale-free network features. When u approaches 1, the uniform distribution of the minimum-matching-energy edges corresponds to random network features. We then design three types of edge attack strategies—minimum-energy (min-E), random-energy (ran-E), and maximum-energy (max-E) attacks—simulating the impacts of critical path destruction, uniform perturbation, and redundancy removal, respectively. In addition, we construct two evaluation indicators, the average matching energy and the matching retention rate. The results show that structural evolution significantly affects network matching robustness in a nonlinear manner. Different attack strategies also exert different influence on matching robustness. Furthermore, the findings reveal the synergistic effects of the two factors on network matching robustness. The synergistic effects of redundancy capacity and network structure on matching robustness are also explored. The research deepens the understanding of network matching robustness and provides a theoretical basis for resource allocation systems to combat network attacks.
Open AccessThe Synergistic Effects of Structural Evolution and Attack Strategies on Network Matching Robustness
Research on network robustness has long focused on changes in the structure connectivity of networks under attacks, effectively depicting structural integrity while ignoring the exploration of functional integrity. When the core path of the network is attacked, even if it remains connected, the rapid increase in energy consumption may still trigger systematic risks. Existing studies mainly use random networks and scale-free networks as comparative models, which has become a classic research paradigm. However, real-world networks often exhibit mixed topological features. To address the above issues, this paper introduces the concept of energy from physics into bipartite networks and establishes an evaluation framework for assessing the synergistic effects of structural evolution and attack strategies on network matching robustness. We first introduce a structural parameter u to construct a structural evolution model, where the network’s minimal matching energy distribution evolves from topological heterogeneity to random features. When u approaches 0, edges with the minimal matching energy concentrate on a few candidates, manifesting scale-free network features. When u approaches 1, the uniform distribution of the minimum-matching-energy edges corresponds to random network features. We then design three types of edge attack strategies—minimum-energy (min-E), random-energy (ran-E), and maximum-energy (max-E) attacks—simulating the impacts of critical path destruction, uniform perturbation, and redundancy removal, respectively. In addition, we construct two evaluation indicators, the average matching energy and the matching retention rate. The results show that structural evolution significantly affects network matching robustness in a nonlinear manner. Different attack strategies also exert different influence on matching robustness. Furthermore, the findings reveal the synergistic effects of the two factors on network matching robustness. The synergistic effects of redundancy capacity and network structure on matching robustness are also explored. The research deepens the understanding of network matching robustness and provides a theoretical basis for resource allocation systems to combat network attacks.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (5) , 3393-3402
The Role of Susceptible Individuals in Spreading Dynamics
Exploring the internal mechanism of information spreading is critical for understanding and controlling the process. Traditional spreading models often assume individuals play the same role in the spreading process. In reality, however, individuals’ diverse characteristics contribute differently to the spreading performance, leading to a heterogeneous infection rate across the system. To investigate network spreading dynamics under heterogeneous infection rates, we integrate two individual-level features—influence (i.e., the ability to influence neighbors) and susceptibility (i.e., the extent to be influenced by neighbors)—into the independent cascade model. Our findings reveal significant differences in spreading performance under heterogeneous and constant infection rates, with traditional structural centrality metrics proving more effective in the latter scenario. Additionally, we take the constant and heterogeneous infection rates into a state-of-the-art maximization algorithm, the well-known TIM algorithm, and find the seeds selected by heterogeneous infection rates are more dispersed compared to those under constant rates. Lastly, we find that both individuals’ influence and susceptibility are vital to the spreading performance. Strikingly, susceptible individuals are particularly important to spreading when information is disseminated by social celebrities. By integrating influence and susceptibility into the spreading model, we gain a more profound understanding of the underlying mechanisms driving information spreading.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (5) , 3393-3402
The Role of Susceptible Individuals in Spreading Dynamics
Exploring the internal mechanism of information spreading is critical for understanding and controlling the process. Traditional spreading models often assume individuals play the same role in the spreading process. In reality, however, individuals’ diverse characteristics contribute differently to the spreading performance, leading to a heterogeneous infection rate across the system. To investigate network spreading dynamics under heterogeneous infection rates, we integrate two individual-level features—influence (i.e., the ability to influence neighbors) and susceptibility (i.e., the extent to be influenced by neighbors)—into the independent cascade model. Our findings reveal significant differences in spreading performance under heterogeneous and constant infection rates, with traditional structural centrality metrics proving more effective in the latter scenario. Additionally, we take the constant and heterogeneous infection rates into a state-of-the-art maximization algorithm, the well-known TIM algorithm, and find the seeds selected by heterogeneous infection rates are more dispersed compared to those under constant rates. Lastly, we find that both individuals’ influence and susceptibility are vital to the spreading performance. Strikingly, susceptible individuals are particularly important to spreading when information is disseminated by social celebrities. By integrating influence and susceptibility into the spreading model, we gain a more profound understanding of the underlying mechanisms driving information spreading.
- 22 June 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 163
Vital node identification in complex networks based on autoencoder and graph neural network
- 22 June 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 163
Vital node identification in complex networks based on autoencoder and graph neural network
- 27 March 2024
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 640
Scaling law of diffusion processes on fractal networks
- 27 March 2024
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 640
Scaling law of diffusion processes on fractal networks