Ziyan Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ziyan Zeng has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Minyu Feng
The College of Artificial Intelligence, Southwest University, Chongqing, China
10 shared publications - Attila Szolnoki
Institute of Technical Physics and Materials Science, Centre for Energy Research 2 , P.O. Box 49, H-1525 Budapest
3 shared publications - Jürgen Kurths
Potsdam Institute for Climate Impact Research, Potsdam, Germany
2 shared publications - Matjaž Perc
University of Maribor
2 shared publications - Qin Li
Business College, Southwest University, Chongqing, China
2 shared publications Yuji Zhang
Southwest Univ, Coll Artificial Intelligence, Chongqing 400715, Peoples R China
2 shared publications
Latest Publications
- 1 July 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (7)
Conformist filtering reshapes cooperation in heterogeneous populations
Understanding how cooperation emerges in structured populations remains a central problem in evolutionary dynamics. Although heterogeneous updating rules and conformist behavior have been studied in evolutionary games, their spatial placement on networks and the resulting weak-selection conditions remain less fully characterized. Here, we develop a theoretical framework that incorporates quenched behavioral heterogeneity by distinguishing between fitness-driven strategists and conformists. By mapping evolutionary dynamics onto a conformist-filtering random walk, we derive an analytical condition for cooperation and identify node-level quantities that quantify how structural positions influence evolutionary outcomes. Our analysis shows that behavioral heterogeneity can substantially reshape cooperative dynamics through a conformist-filtering mechanism. Optimal intervention strategies are intrinsically non-nested, meaning that the set of nodes selected under tight budgets may differ entirely from those chosen under larger budgets. Analytical examples further reveal a gatekeeper effect in certain network structures, where nodes bridging communities exert disproportionate influence on cooperative spreading despite modest connectivity. These findings demonstrate that cooperation in heterogeneous populations is governed jointly by network topology and behavioral diversity, providing a principled framework for optimizing collective behavior in complex networks.
- 1 July 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (7)
Conformist filtering reshapes cooperation in heterogeneous populations
Understanding how cooperation emerges in structured populations remains a central problem in evolutionary dynamics. Although heterogeneous updating rules and conformist behavior have been studied in evolutionary games, their spatial placement on networks and the resulting weak-selection conditions remain less fully characterized. Here, we develop a theoretical framework that incorporates quenched behavioral heterogeneity by distinguishing between fitness-driven strategists and conformists. By mapping evolutionary dynamics onto a conformist-filtering random walk, we derive an analytical condition for cooperation and identify node-level quantities that quantify how structural positions influence evolutionary outcomes. Our analysis shows that behavioral heterogeneity can substantially reshape cooperative dynamics through a conformist-filtering mechanism. Optimal intervention strategies are intrinsically non-nested, meaning that the set of nodes selected under tight budgets may differ entirely from those chosen under larger budgets. Analytical examples further reveal a gatekeeper effect in certain network structures, where nodes bridging communities exert disproportionate influence on cooperative spreading despite modest connectivity. These findings demonstrate that cooperation in heterogeneous populations is governed jointly by network topology and behavioral diversity, providing a principled framework for optimizing collective behavior in complex networks.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 296-313
Evolutionary Dynamics With Self-Interaction Learning in Networked Systems
The evolution of cooperation in networked systems helps to understand the dynamics in social networks, multi-agent systems, and biological species. The self-persistence of individual strategies is common in real-world decision making. The self-replacement of strategies in evolutionary dynamics forms a selection amplifier, allows an agent to insist on its autologous strategy, and helps the networked system to avoid full defection. In this paper, we study the self-interaction learning in the networked evolutionary dynamics. We propose a self-interaction landscape to capture the strength of an agent's self-loop to reproduce the strategy based on local topology. We find that proper self-interaction can reduce the condition for cooperation and help cooperators to prevail in the system. For a system that favors the evolution of spite, the self-interaction can save cooperative agents from being harmed. Our results on random networks further suggest that an appropriate self-interaction landscape can significantly reduce the critical condition for advantageous mutants, especially for large-degree networks.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 296-313
Evolutionary Dynamics With Self-Interaction Learning in Networked Systems
The evolution of cooperation in networked systems helps to understand the dynamics in social networks, multi-agent systems, and biological species. The self-persistence of individual strategies is common in real-world decision making. The self-replacement of strategies in evolutionary dynamics forms a selection amplifier, allows an agent to insist on its autologous strategy, and helps the networked system to avoid full defection. In this paper, we study the self-interaction learning in the networked evolutionary dynamics. We propose a self-interaction landscape to capture the strength of an agent's self-loop to reproduce the strategy based on local topology. We find that proper self-interaction can reduce the condition for cooperation and help cooperators to prevail in the system. For a system that favors the evolution of spite, the self-interaction can save cooperative agents from being harmed. Our results on random networks further suggest that an appropriate self-interaction landscape can significantly reduce the critical condition for advantageous mutants, especially for large-degree networks.
- Top Cited Papers
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (4) , 2546-2559
Complex Network Modeling With Power-Law Activating Patterns and Its Evolutionary Dynamics
Complex network theory provides a unifying framework for the study of structured dynamic systems. The current literature emphasizes a widely reported phenomenon of intermittent interaction among network vertices. In this article, we introduce a complex network model that considers the stochastic switching of individuals between activated and quiescent states at power-law rates and the corresponding evolutionary dynamics. By using the Markov chain and renewal theory, we discover a homogeneous stationary distribution of activated sizes in the network with power-law activating patterns and infer some statistical characteristics. To better understand the effect of power-law activating patterns, we study the two-person-two-strategy evolutionary game dynamics, demonstrate the absorbability of strategies, and obtain the critical cooperation conditions for prisoner’s dilemmas in homogeneous networks without mutation. The evolutionary dynamics in real networks are also discussed. Our results provide a new perspective to analyze and understand social physics in time-evolving network systems.
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (4) , 2546-2559
Top Cited PapersComplex Network Modeling With Power-Law Activating Patterns and Its Evolutionary Dynamics
Complex network theory provides a unifying framework for the study of structured dynamic systems. The current literature emphasizes a widely reported phenomenon of intermittent interaction among network vertices. In this article, we introduce a complex network model that considers the stochastic switching of individuals between activated and quiescent states at power-law rates and the corresponding evolutionary dynamics. By using the Markov chain and renewal theory, we discover a homogeneous stationary distribution of activated sizes in the network with power-law activating patterns and infer some statistical characteristics. To better understand the effect of power-law activating patterns, we study the two-person-two-strategy evolutionary game dynamics, demonstrate the absorbability of strategies, and obtain the critical cooperation conditions for prisoner’s dilemmas in homogeneous networks without mutation. The evolutionary dynamics in real networks are also discussed. Our results provide a new perspective to analyze and understand social physics in time-evolving network systems.
- 23 July 2024
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 186
Adherence strategy based on evolutionary games in epidemic spreading
- 23 July 2024
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 186
Adherence strategy based on evolutionary games in epidemic spreading
- 20 May 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 477
Defined benefit pension plan inhibit the emergence of cooperation in the public goods games
- 20 May 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 477
Defined benefit pension plan inhibit the emergence of cooperation in the public goods games
- Top Cited Papers
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (8) , 5123-5136
Information Dynamics in Evolving Networks Based on the Birth-Death Process: Random Drift and Natural Selection Perspective
Dynamic processes in complex network are crucial for better understanding collective behavior in human societies, biological systems, and the Internet. In this article, we first focus on the continuous Markov-based modeling of evolving networks with the birth-death of individuals. A new individual arrives at the group by the Poisson process, while new links are established in the network through either uniform connection or preferential attachment. Moreover, an existing individual has a limited lifespan before leaving the network. We determine stationary topological properties of these networks, including their size and mean degree. To address the effect of the birth-death evolution, we further study the information dynamics in the proposed network model from the random drift and natural selection perspective, based on assumptions of total-stochastic and fitness-driven evolution, respectively. In simulations, we analyze the fixation probability of individual information and find that means of new connections affect the random drift process but do not affect the natural selection process.
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (8) , 5123-5136
Top Cited PapersInformation Dynamics in Evolving Networks Based on the Birth-Death Process: Random Drift and Natural Selection Perspective
Dynamic processes in complex network are crucial for better understanding collective behavior in human societies, biological systems, and the Internet. In this article, we first focus on the continuous Markov-based modeling of evolving networks with the birth-death of individuals. A new individual arrives at the group by the Poisson process, while new links are established in the network through either uniform connection or preferential attachment. Moreover, an existing individual has a limited lifespan before leaving the network. We determine stationary topological properties of these networks, including their size and mean degree. To address the effect of the birth-death evolution, we further study the information dynamics in the proposed network model from the random drift and natural selection perspective, based on assumptions of total-stochastic and fitness-driven evolution, respectively. In simulations, we analyze the fixation probability of individual information and find that means of new connections affect the random drift process but do not affect the natural selection process.
- Open Access
- 1 February 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (2)
Coevolution of relationship and interaction in cooperative dynamical multiplex networks
While actors in a population can interact with anyone else freely, social relations significantly influence our inclination toward particular individuals. The consequence of such interactions, however, may also form the intensity of our relations established earlier. These dynamical processes are captured via a coevolutionary model staged in multiplex networks with two distinct layers. In a so-called relationship layer, the weights of edges among players may change in time as a consequence of games played in the alternative interaction layer. As an reasonable assumption, bilateral cooperation confirms while mutual defection weakens these weight factors. Importantly, the fitness of a player, which basically determines the success of a strategy imitation, depends not only on the payoff collected from interactions, but also on the individual relationship index calculated from the mentioned weight factors of related edges. Within the framework of weak prisoner’s dilemma situation, we explore the potential outcomes of the mentioned coevolutionary process where we assume different topologies for relationship layer. We find that higher average degree of the relationship graph is more beneficial to maintain cooperation in regular graphs, but the randomness of links could be a decisive factor in harsh situations. Surprisingly, a stronger coupling between relationship index and fitness discourage the evolution of cooperation by weakening the direct consequence of a strategy change. To complete our study, we also monitor how the distribution of relationship index vary and detect a strong relation between its polarization and the general cooperation level.
- 1 February 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (2)
Open AccessCoevolution of relationship and interaction in cooperative dynamical multiplex networks
While actors in a population can interact with anyone else freely, social relations significantly influence our inclination toward particular individuals. The consequence of such interactions, however, may also form the intensity of our relations established earlier. These dynamical processes are captured via a coevolutionary model staged in multiplex networks with two distinct layers. In a so-called relationship layer, the weights of edges among players may change in time as a consequence of games played in the alternative interaction layer. As an reasonable assumption, bilateral cooperation confirms while mutual defection weakens these weight factors. Importantly, the fitness of a player, which basically determines the success of a strategy imitation, depends not only on the payoff collected from interactions, but also on the individual relationship index calculated from the mentioned weight factors of related edges. Within the framework of weak prisoner’s dilemma situation, we explore the potential outcomes of the mentioned coevolutionary process where we assume different topologies for relationship layer. We find that higher average degree of the relationship graph is more beneficial to maintain cooperation in regular graphs, but the randomness of links could be a decisive factor in harsh situations. Surprisingly, a stronger coupling between relationship index and fitness discourage the evolution of cooperation by weakening the direct consequence of a strategy change. To complete our study, we also monitor how the distribution of relationship index vary and detect a strong relation between its polarization and the general cooperation level.
- 15 June 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 457
An evolutionary game with revengers and sufferers on complex networks
- 15 June 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 457
An evolutionary game with revengers and sufferers on complex networks
- Open Access
- 1 June 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (6)
Inhibition and activation of interactions in networked weak prisoner’s dilemma
In the framework of the coevolution dynamics of the weak prisoner’s dilemma, inspired by prior empirical research, we present a coevolutionary model with local network dynamics in a static network framework. Viewing the edges of the network as social interactions between individuals, when individuals play the weak prisoner’s dilemma game, they accumulate both payoffs and social interaction willingness based on a payoff matrix of the social interaction willingness we constructed. The edges are then inhibiting or activating based on the social interaction willingness of the two individuals, and individuals only interact with others through activated edges, resulting in local network dynamics in a static network framework. Individuals who receive more cooperation will be more likely to activate the edges around them, meaning they will participate in more social interactions. Conversely, individuals who receive more defects will do the opposite. Specifically, we investigate the evolutionary dynamics of cooperation under different levels of sensitivity to social interaction willingness and the temptation to defect. Through the simulation, we find that sparse cooperator clusters can expand greatly when social interaction sensitivity and temptation to defect are low. In contrast, dense cooperator clusters form rapidly in a high social interaction sensitivity, which protects the cooperation from high temptation.
- 1 June 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (6)
Open AccessInhibition and activation of interactions in networked weak prisoner’s dilemma
In the framework of the coevolution dynamics of the weak prisoner’s dilemma, inspired by prior empirical research, we present a coevolutionary model with local network dynamics in a static network framework. Viewing the edges of the network as social interactions between individuals, when individuals play the weak prisoner’s dilemma game, they accumulate both payoffs and social interaction willingness based on a payoff matrix of the social interaction willingness we constructed. The edges are then inhibiting or activating based on the social interaction willingness of the two individuals, and individuals only interact with others through activated edges, resulting in local network dynamics in a static network framework. Individuals who receive more cooperation will be more likely to activate the edges around them, meaning they will participate in more social interactions. Conversely, individuals who receive more defects will do the opposite. Specifically, we investigate the evolutionary dynamics of cooperation under different levels of sensitivity to social interaction willingness and the temptation to defect. Through the simulation, we find that sparse cooperator clusters can expand greatly when social interaction sensitivity and temptation to defect are low. In contrast, dense cooperator clusters form rapidly in a high social interaction sensitivity, which protects the cooperation from high temptation.