Xiang Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiang Li has a total of 210 co-authors. Here are the top co-authors by number of shared publications:
- Cong Li
Adaptive Networks and Control Laboratory, College of Future Information Technology, Fudan University, Shanghai, China
15 shared publications - Guanrong Chen
Department of Electrical Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong SAR, P. R. China
11 shared publications - Jie Ding
Department of Electronic Engineering, School of Information Science and Engineering, Adaptive Networks and Control Laboratory, Fudan University, Shanghai, China
8 shared publications Yan Zhang
Department of Electronic Engineering Adaptive Networks and Control Lab Fudan University 200433 Shanghai PR China
7 shared publicationsChangbing Tang
Adaptive Networks and Control Laboratory, Department of Electronic Engineering, Fudan University, Shanghai 200433, China, and also with the College of Mathematics, Physics, and Information Engineering, Zhejiang Normal University, Jinhua 321004, China
5 shared publications- Lin Wang
Department of Genetics, University of Cambridge
5 shared publications
Latest Publications
- 29 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-11
Diffusion Graph Transformer for Learning Controllability Robustness in Large-Scale Networks
Network controllability robustness refers to the ability of networks to maintain controllability in the face of various attacks, which is typically determined by recording a series of controllability values under sustained attacks in simulations. However, conducting such simulation experiments is often extremely time-consuming. Particularly, for large-scale networks, such simulation experiments are even infeasible. Therefore, in order to replace the traditional simulations, we propose a method named diffusion graph transformer (DGT) in this work for learning controllability robustness of complex networks under batch attacks by leveraging the descriptive capability of the graph attention mechanism in node feature representation and the effectiveness of the diffusion principle in feature propagation. DGT first generates embeddings based on node degree attributes, then adaptively propagates the transformed features through a specially designed diffusion strategy, followed by a fully connected layer for the final prediction. Extensive experimental results demonstrate that: 1) DGT exhibits excellent accuracy and significant speed advantages in the task of controllability robustness learning of complex networks; 2) compared to current related research on complex network robustness learning tasks, DGT is the first to address the controllability robustness learning task under batch attacks on large-scale networks, and it demonstrates strong generalization performance in terms of network scale, being applicable to networks with hundreds of thousands of nodes; and 3) the DGT model excels in transferability in terms of attack batch sizes, offering flexibility in predicting network controllability robustness toward various attack batches.
- 29 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-11
Diffusion Graph Transformer for Learning Controllability Robustness in Large-Scale Networks
Network controllability robustness refers to the ability of networks to maintain controllability in the face of various attacks, which is typically determined by recording a series of controllability values under sustained attacks in simulations. However, conducting such simulation experiments is often extremely time-consuming. Particularly, for large-scale networks, such simulation experiments are even infeasible. Therefore, in order to replace the traditional simulations, we propose a method named diffusion graph transformer (DGT) in this work for learning controllability robustness of complex networks under batch attacks by leveraging the descriptive capability of the graph attention mechanism in node feature representation and the effectiveness of the diffusion principle in feature propagation. DGT first generates embeddings based on node degree attributes, then adaptively propagates the transformed features through a specially designed diffusion strategy, followed by a fully connected layer for the final prediction. Extensive experimental results demonstrate that: 1) DGT exhibits excellent accuracy and significant speed advantages in the task of controllability robustness learning of complex networks; 2) compared to current related research on complex network robustness learning tasks, DGT is the first to address the controllability robustness learning task under batch attacks on large-scale networks, and it demonstrates strong generalization performance in terms of network scale, being applicable to networks with hundreds of thousands of nodes; and 3) the DGT model excels in transferability in terms of attack batch sizes, offering flexibility in predicting network controllability robustness toward various attack batches.
- 5 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (2) , 1192-1204
Bearing-Based Three-Dimensional Circumnavigation Control of Multiagent Systems With Local Reference Frames
This paper proposes a bearing-based three-dimensional circumnavigation control method for multi-agent systems with local reference frames. Unlike most existing studies, which confine the circumnavigation to a single plane, we present a novel approach that enables multiple agents to circumnavigate an unknown stationary or slowly moving target across multiple planes at different altitudes in three-dimensional space. First, an orientation control law is designed to drive agents to maintain the desired relative orientations of their local reference frames. Then, a circumnavigation control law is developed to guide agents to achieve three-dimensional circumnavigation around the target. The desired formation, defined by local inter-neighbor bearing measurements, determines the spatial distribution of agents. Only an informed agent has knowledge of the desired angular velocity for circular circumnavigation and the normal vector of the orbit. The proposed control laws guarantee exponential convergence and ensure collision avoidance. Simulations validate the effectiveness and robustness of the proposed method, even in scenarios where some agents break down or partial bearing measurements are unavailable.
- 5 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (2) , 1192-1204
Bearing-Based Three-Dimensional Circumnavigation Control of Multiagent Systems With Local Reference Frames
This paper proposes a bearing-based three-dimensional circumnavigation control method for multi-agent systems with local reference frames. Unlike most existing studies, which confine the circumnavigation to a single plane, we present a novel approach that enables multiple agents to circumnavigate an unknown stationary or slowly moving target across multiple planes at different altitudes in three-dimensional space. First, an orientation control law is designed to drive agents to maintain the desired relative orientations of their local reference frames. Then, a circumnavigation control law is developed to guide agents to achieve three-dimensional circumnavigation around the target. The desired formation, defined by local inter-neighbor bearing measurements, determines the spatial distribution of agents. Only an informed agent has knowledge of the desired angular velocity for circular circumnavigation and the normal vector of the orbit. The proposed control laws guarantee exponential convergence and ensure collision avoidance. Simulations validate the effectiveness and robustness of the proposed method, even in scenarios where some agents break down or partial bearing measurements are unavailable.
- 3 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
Adaptive overlap penalization and probabilistic modeling in hypergraph influence maximization
- 3 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
Adaptive overlap penalization and probabilistic modeling in hypergraph influence maximization
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2257-2262
Temporal Segmentation Endows Networks With Strong Structural Controllability
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2257-2262
Temporal Segmentation Endows Networks With Strong Structural Controllability
- 2 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (2) , 980-991
Constrained Maximal Controllability of Complex Networks
This article focuses on the constrained maximal controllability of complex networks, which aims to maximize the generic dimension of controllable subspace of networks with a given candidate set of constrained input locations. To address this issue, we first transform it to a maximum general-cactus cover problem. By introducing network flow, this problem is further converted to a minimum-cost maximum-flow problem. An algorithm named minimum-cost maximum-flow-based general-cactus cover (MMGC) is proposed to achieve the optimal solution. Furthermore, a series of simulations on Erdős–Rényi networks (ERNs) and scale-free networks (SFNs) and applications in network controllability robustness demonstrates the effectiveness of MMGC. The simulation results have revealed that augmenting the number or range of inputs can enhance the controllability of networks, and the presence of multicyclic structures significantly strengthens the controllability robustness of complex networks.
- 2 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (2) , 980-991
Constrained Maximal Controllability of Complex Networks
This article focuses on the constrained maximal controllability of complex networks, which aims to maximize the generic dimension of controllable subspace of networks with a given candidate set of constrained input locations. To address this issue, we first transform it to a maximum general-cactus cover problem. By introducing network flow, this problem is further converted to a minimum-cost maximum-flow problem. An algorithm named minimum-cost maximum-flow-based general-cactus cover (MMGC) is proposed to achieve the optimal solution. Furthermore, a series of simulations on Erdős–Rényi networks (ERNs) and scale-free networks (SFNs) and applications in network controllability robustness demonstrates the effectiveness of MMGC. The simulation results have revealed that augmenting the number or range of inputs can enhance the controllability of networks, and the presence of multicyclic structures significantly strengthens the controllability robustness of complex networks.
- 29 November 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 333
Balancer: Temporal knowledge graph embedding for novel events reasoning with contrastive learning
- 29 November 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 333
Balancer: Temporal knowledge graph embedding for novel events reasoning with contrastive learning
- 4 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 3240-3255
How Human Spatio-Temporal Behaviors Facilitate Epidemics in Functionality Social Networks
The spread of infectious diseases is intricately linked to individual mobility and contact patterns. Analyzing the interrelationship between the factors is essential for understanding the spreading dynamic. Most studies explore the impact of contact topology across different locations, however, individual mobility behaviors and contact intensity on the epidemic spreading have not been fully studied. In fact, individuals of different types exhibit distinct mobility behaviors, with a strong preference for specific functional locations. Meanwhile, contact patterns display spatial heterogeneity and same-type preference. In this work, we construct a temporal multilayer network to characterize the diverse interactions under different functional locations. To represent various mobility and contact patterns, we design the interlayer preferred intensity function and contact intensity matrix, respectively. Moreover, we adopt the microscopic Markov chain approach and derive the infectious epidemic threshold. Our findings indicate that high-contact-density locations are more prone to disease outbreaks than the low. Furthermore, we find that strong mobility preferences promote the formation of the high-risk infection group, thereby facilitating disease outbreaks. In this mode, high-intensity intra-type interactions among individuals further accelerate disease spread. These results reveal that infection risk is linked to the behaviors of individuals and their contacts. The findings are verified in real-world networks. In addition, an interface for exploring open systems has been introduced. In total, the work reveals the relationship between mobility patterns, contact behaviors, and disease spreading, providing a new direction and insight for disease control.
- 4 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 3240-3255
How Human Spatio-Temporal Behaviors Facilitate Epidemics in Functionality Social Networks
The spread of infectious diseases is intricately linked to individual mobility and contact patterns. Analyzing the interrelationship between the factors is essential for understanding the spreading dynamic. Most studies explore the impact of contact topology across different locations, however, individual mobility behaviors and contact intensity on the epidemic spreading have not been fully studied. In fact, individuals of different types exhibit distinct mobility behaviors, with a strong preference for specific functional locations. Meanwhile, contact patterns display spatial heterogeneity and same-type preference. In this work, we construct a temporal multilayer network to characterize the diverse interactions under different functional locations. To represent various mobility and contact patterns, we design the interlayer preferred intensity function and contact intensity matrix, respectively. Moreover, we adopt the microscopic Markov chain approach and derive the infectious epidemic threshold. Our findings indicate that high-contact-density locations are more prone to disease outbreaks than the low. Furthermore, we find that strong mobility preferences promote the formation of the high-risk infection group, thereby facilitating disease outbreaks. In this mode, high-intensity intra-type interactions among individuals further accelerate disease spread. These results reveal that infection risk is linked to the behaviors of individuals and their contacts. The findings are verified in real-world networks. In addition, an interface for exploring open systems has been introduced. In total, the work reveals the relationship between mobility patterns, contact behaviors, and disease spreading, providing a new direction and insight for disease control.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 446-459
Finite Strategy Switches of Coordinating and Anti-Coordinating Games on Weighted Networks
Complex strategic interactions of rational agents are ubiquitous in decision-making groups which greatly influence the evolutionary dynamics of many real-life networked systems. Here, we study how individual decision-making behaviors evolve when the topology of network interactions is weighted, and how the network of mixed coordinating and anti-coordinating games is driven to an equilibrium. We prove that the weighted pure coordinating or anti-coordinating decision-making dynamics, under both asynchronous and partially synchronous updates, will converge to the Nash equilibrium after finite strategy switches. Moreover, it follows that the upper bound on the number of switches for the convergence depends on the number of agents and the weights’ distribution under asynchronous update. For mixed coordinating and anti-coordinating games, we find that network game dynamics can be decoupled into convergence and nonconvergence regions under certain conditions, in which the global convergence can be established by adding leaf vertices. For more general cases, we devise the incentive mechanisms for agents to achieve the convergence. We also extend the incentive performance of fully asynchronous updating to the partially synchronous updating. Our results provide hints on the typology and incentive mechanisms to induce the convergence of mixed gaming networks.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 446-459
Finite Strategy Switches of Coordinating and Anti-Coordinating Games on Weighted Networks
Complex strategic interactions of rational agents are ubiquitous in decision-making groups which greatly influence the evolutionary dynamics of many real-life networked systems. Here, we study how individual decision-making behaviors evolve when the topology of network interactions is weighted, and how the network of mixed coordinating and anti-coordinating games is driven to an equilibrium. We prove that the weighted pure coordinating or anti-coordinating decision-making dynamics, under both asynchronous and partially synchronous updates, will converge to the Nash equilibrium after finite strategy switches. Moreover, it follows that the upper bound on the number of switches for the convergence depends on the number of agents and the weights’ distribution under asynchronous update. For mixed coordinating and anti-coordinating games, we find that network game dynamics can be decoupled into convergence and nonconvergence regions under certain conditions, in which the global convergence can be established by adding leaf vertices. For more general cases, we devise the incentive mechanisms for agents to achieve the convergence. We also extend the incentive performance of fully asynchronous updating to the partially synchronous updating. Our results provide hints on the typology and incentive mechanisms to induce the convergence of mixed gaming networks.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. PP (21682216) , 1-15
Higher Order Epidemic Spreading in Simplicial Networks
The spread of epidemics is a complex process influenced by multiple social relations, including families, schools, and companies. Group interactions represented by a simplicial complex have been shown to impact the dynamics of epidemic transmission significantly. However, the previously proposed higher order contagion models only consider the propagation process within the higher order structure but lack a description of the consistency of the node states in the structure. To address this problem, we provide solutions to create a solvable network model that shows network clusters and node state consistency tendencies, capable of capturing the coexistence of interacting groups. We analyze the bistable region and epidemic threshold of the higher order propagation dynamics and explore the effect of the state update of the nodes on the model in: 1) random regular simplicial networks; 2) triangular simplex-lattice networks; 3) star-simplicial networks; and 4) heterogeneous simplicial networks. Our theoretical analysis, complemented by Monte Carlo numerical simulations, demonstrates that the proposed model accurately captures phase transitions and the bistable region created by higher order interactions. In addition, we find that the incorporation of intersimplex interaction mechanisms greatly reduces the epidemic threshold of the system and produces a larger bistable region, in which the dynamics of the system are heavily affected by the density and location of the initially infected nodes. Our findings contribute to a better understanding of higher order interactions in complex networked systems.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. PP (21682216) , 1-15
Higher Order Epidemic Spreading in Simplicial Networks
The spread of epidemics is a complex process influenced by multiple social relations, including families, schools, and companies. Group interactions represented by a simplicial complex have been shown to impact the dynamics of epidemic transmission significantly. However, the previously proposed higher order contagion models only consider the propagation process within the higher order structure but lack a description of the consistency of the node states in the structure. To address this problem, we provide solutions to create a solvable network model that shows network clusters and node state consistency tendencies, capable of capturing the coexistence of interacting groups. We analyze the bistable region and epidemic threshold of the higher order propagation dynamics and explore the effect of the state update of the nodes on the model in: 1) random regular simplicial networks; 2) triangular simplex-lattice networks; 3) star-simplicial networks; and 4) heterogeneous simplicial networks. Our theoretical analysis, complemented by Monte Carlo numerical simulations, demonstrates that the proposed model accurately captures phase transitions and the bistable region created by higher order interactions. In addition, we find that the incorporation of intersimplex interaction mechanisms greatly reduces the epidemic threshold of the system and produces a larger bistable region, in which the dynamics of the system are heavily affected by the density and location of the initially infected nodes. Our findings contribute to a better understanding of higher order interactions in complex networked systems.