Leyang Xue
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
Leyang Xue has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Zengru Di
Beijing Normal University
4 shared publications - Bnaya Gross
Northeastern University
2 shared publications - Peng-Bi Cui
Beijing Normal University
2 shared publications - Shlomo Havlin
Bar-Ilan University
2 shared publications - An Zeng
Guangdong University of Technology
1 shared publication Daqing Li
School of Reliability and Systems Engineering, Beihang University, Beijing, China
1 shared publication
Latest Publications
- 9 October 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (41)
Contagion-preserving compression for multiscale epidemic modeling
Understanding how contagion unfolds on large, heterogeneous networks is essential for predicting and controlling spreading processes, yet structural complexity often obscures the mechanisms governing transmission across scales. Here, we show that contagion is naturally organized around dense local structures that become dynamical spreading units once infection saturates within them. Building on this principle, we introduce iterative structural coarse-graining (ISCG), a framework that compresses large networks into interpretable multiscale representations while retaining the contagion dynamics of the original system. In this saturation regime, these representations reproduce macroscopic outbreak sizes, node-level infection risks, and spatiotemporal infection trajectories across scales. Beyond this regime, ISCG enables controlled trade-offs between dynamical fidelity and structural compression. The resulting multiscale representations support mechanism-driven intervention strategies, including influence maximization, immunization, and surveillance, that consistently outperform adaptive centrality–based methods. These results establish a general multiscale framework for representing, understanding, and controlling contagion in networked systems.
- 9 October 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (41)
Contagion-preserving compression for multiscale epidemic modeling
Understanding how contagion unfolds on large, heterogeneous networks is essential for predicting and controlling spreading processes, yet structural complexity often obscures the mechanisms governing transmission across scales. Here, we show that contagion is naturally organized around dense local structures that become dynamical spreading units once infection saturates within them. Building on this principle, we introduce iterative structural coarse-graining (ISCG), a framework that compresses large networks into interpretable multiscale representations while retaining the contagion dynamics of the original system. In this saturation regime, these representations reproduce macroscopic outbreak sizes, node-level infection risks, and spatiotemporal infection trajectories across scales. Beyond this regime, ISCG enables controlled trade-offs between dynamical fidelity and structural compression. The resulting multiscale representations support mechanism-driven intervention strategies, including influence maximization, immunization, and surveillance, that consistently outperform adaptive centrality–based methods. These results establish a general multiscale framework for representing, understanding, and controlling contagion in networked systems.
- 31 January 2026
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 273
Nonlinear random walks on hypergraphs characterized by higher-order interactions
- 31 January 2026
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 273
Nonlinear random walks on hypergraphs characterized by higher-order interactions
- Open Access
- 21 January 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Network localization governs social contagion dynamics with macro-level reinforcement
The spread of ideas, behaviors, and technologies generally depends on feedback mechanisms operating across multiple scales. Previous studies have extensively examined pairwise transmission and local reinforcement. However, the role of macro-level social influence—where widespread adoption enhances further adoption—remains understudied. Here, we focus on a contagion process that incorporates both pairwise interactions and macro-level reinforcement. We show that the contagion undergoes a shift from continuous to mixed-order transition as macro-level influence exceeds a reinforcement threshold. Simulations on various real-world networks indicate that network localization governs the contagion outcomes by determining the critical point and the reinforcement threshold. Building on this insight, we develop a structural metric linking network localization to contagion dynamics, revealing a key trade-off: Networks that facilitate weak contagion tend to experience slower diffusion and lower adoption rates, while networks that suppress weak contagions enable faster and more widespread adoption. These findings challenge the conventional belief that stronger local connectivity uniformly promotes contagion.
- 21 January 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessNetwork localization governs social contagion dynamics with macro-level reinforcement
The spread of ideas, behaviors, and technologies generally depends on feedback mechanisms operating across multiple scales. Previous studies have extensively examined pairwise transmission and local reinforcement. However, the role of macro-level social influence—where widespread adoption enhances further adoption—remains understudied. Here, we focus on a contagion process that incorporates both pairwise interactions and macro-level reinforcement. We show that the contagion undergoes a shift from continuous to mixed-order transition as macro-level influence exceeds a reinforcement threshold. Simulations on various real-world networks indicate that network localization governs the contagion outcomes by determining the critical point and the reinforcement threshold. Building on this insight, we develop a structural metric linking network localization to contagion dynamics, revealing a key trade-off: Networks that facilitate weak contagion tend to experience slower diffusion and lower adoption rates, while networks that suppress weak contagions enable faster and more widespread adoption. These findings challenge the conventional belief that stronger local connectivity uniformly promotes contagion.
- 7 March 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 194
Social contagion with emotional group interactions
- 7 March 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 194
Social contagion with emotional group interactions
- Open Access
- 12 July 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-10
Nucleation phenomena and extreme vulnerability of spatial k-core systems
K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing mixed-order transitions. However, real-world systems, ranging from transportation and communication networks to complex brain networks, are not random but are spatially embedded. Here, we study k-core percolation on two-dimensional spatially embedded networks and show that, in contrast to regular percolation, the length of connections can control the transition type, leading to four different types of phase transitions associated with interesting phenomena and a rich phase diagram. A key finding is the existence of a metastable phase where microscopic localized damage, independent of system size, can cause a macroscopic phase transition, a result which cannot be achieved in traditional percolation. In this case, local failures spontaneously propagate the damage radially until the system collapses, a phenomenon analogous to the nucleation process.
- 12 July 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-10
Open AccessNucleation phenomena and extreme vulnerability of spatial k-core systems
K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing mixed-order transitions. However, real-world systems, ranging from transportation and communication networks to complex brain networks, are not random but are spatially embedded. Here, we study k-core percolation on two-dimensional spatially embedded networks and show that, in contrast to regular percolation, the length of connections can control the transition type, leading to four different types of phase transitions associated with interesting phenomena and a rich phase diagram. A key finding is the existence of a metastable phase where microscopic localized damage, independent of system size, can cause a macroscopic phase transition, a result which cannot be achieved in traditional percolation. In this case, local failures spontaneously propagate the damage radially until the system collapses, a phenomenon analogous to the nucleation process.
- Open Access
- 1 January 2024
- Published by IOP Publishing in New Journal of Physics
- Vol. 26 (1) , 013006
Possible origin for the similar phase transitions in k-core and interdependent networks
The models of k-core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered exponents in IN have not been explored in k-core percolation, and the origin of the similarity still remains unclear. Thus, in this paper, by considering k-core percolation on random networks, we first verify that the two newly discovered exponents (fractal fluctuation dimension, d f ′ , and correlation length exponent, ν ′ ) observed in d-dimensional IN spatial networks also exist with the same values in k-core percolation. That is, the fractality of the k-core giant component fluctuations is manifested by a fractal fluctuation dimension, d ˜ f = 3 / 4 , within a correlation size Nʹ that scales as N ′ ∝ ( p − p c ) − ν ˜ , with ν ˜ = 2 . Here we define, ν ˜ ≡ d ⋅ ν ′ and d ˜ f ≡ d f ′ / d . This implies that both models, IN and k-core, feature the same scaling behaviors with the same critical exponents, further reinforcing the similarity between the two models. Furthermore, we suggest that these two models are similar since both have two types of interactions: short-range (SR) connectivity links and long-range (LR) influences. In IN the LR are the influences of dependency links while in k-core we find here that for k = 1 and k = 2 the influences are SR and in contrast for k ⩾ 3 the influence is LR. In addition, analytical arguments for a universal hyper-scaling relation for the fractal fluctuation dimension of the k-core giant component and for IN as well as for any mixed-order transition are established. Our analysis enhances the comprehension of k-core percolation and supports the generalization of the concept of fractal fluctuations in mixed-order phase transitions.
- 1 January 2024
- Published by IOP Publishing in New Journal of Physics
- Vol. 26 (1) , 013006
Open AccessPossible origin for the similar phase transitions in k-core and interdependent networks
The models of k-core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered exponents in IN have not been explored in k-core percolation, and the origin of the similarity still remains unclear. Thus, in this paper, by considering k-core percolation on random networks, we first verify that the two newly discovered exponents (fractal fluctuation dimension, d f ′ , and correlation length exponent, ν ′ ) observed in d-dimensional IN spatial networks also exist with the same values in k-core percolation. That is, the fractality of the k-core giant component fluctuations is manifested by a fractal fluctuation dimension, d ˜ f = 3 / 4 , within a correlation size Nʹ that scales as N ′ ∝ ( p − p c ) − ν ˜ , with ν ˜ = 2 . Here we define, ν ˜ ≡ d ⋅ ν ′ and d ˜ f ≡ d f ′ / d . This implies that both models, IN and k-core, feature the same scaling behaviors with the same critical exponents, further reinforcing the similarity between the two models. Furthermore, we suggest that these two models are similar since both have two types of interactions: short-range (SR) connectivity links and long-range (LR) influences. In IN the LR are the influences of dependency links while in k-core we find here that for k = 1 and k = 2 the influences are SR and in contrast for k ⩾ 3 the influence is LR. In addition, analytical arguments for a universal hyper-scaling relation for the fractal fluctuation dimension of the k-core giant component and for IN as well as for any mixed-order transition are established. Our analysis enhances the comprehension of k-core percolation and supports the generalization of the concept of fractal fluctuations in mixed-order phase transitions.
- Open Access
- 1 May 2023
- Published by IOP Publishing in New Journal of Physics
- Vol. 25 (5) , 053009
Identifying the structure patterns to govern the performance of localization in regulating innovation diffusion
The macro social influence is recognized as a non-negligible ingredient in innovation propagation: more adopters in the network lead to a higher adoption tendency for the rest individuals. A recent study to incorporate such a crucial mechanism shows that sufficient intensity of macro-level social influence can cause a change from a continuous to discontinuous transition, further indicating the existence of a tricritical point. Although network localization strength determines the tricritical point, it remains unclear what network quantities govern the performance of localization in regulating innovation diffusion. To address this issue, we herein consider the model incorporating both the micro- and macro-levels social influence. We present a dynamic message-passing method to analytically treat both the outbreak threshold and recovered population, and validate the predictions through agent-based simulations. Extensive analysis on the classical synthetic networks shows that sparsely available connections, and relatively heterogeneous degree distribution, either assortative or extremely disassortative configurations are favorable for continuous transition. In such cases, the employed network can yield a strong localization effect so that the innovation is trapped in the configurations composed of the hubs with high non-backtracking centrality. We further explore the dependence of both tricritical point and localization strength on three structural quantities: network density, heterogeneity, and assortativity, which gives a clear physical picture of the joint effects of the three structure quantities on the localization strength. Finally, we conclude that the core-periphery structure, being sensitive to the change of the three structure quantities, essentially determines localization strength, and further regulates the phase transition.
- 1 May 2023
- Published by IOP Publishing in New Journal of Physics
- Vol. 25 (5) , 053009
Open AccessIdentifying the structure patterns to govern the performance of localization in regulating innovation diffusion
The macro social influence is recognized as a non-negligible ingredient in innovation propagation: more adopters in the network lead to a higher adoption tendency for the rest individuals. A recent study to incorporate such a crucial mechanism shows that sufficient intensity of macro-level social influence can cause a change from a continuous to discontinuous transition, further indicating the existence of a tricritical point. Although network localization strength determines the tricritical point, it remains unclear what network quantities govern the performance of localization in regulating innovation diffusion. To address this issue, we herein consider the model incorporating both the micro- and macro-levels social influence. We present a dynamic message-passing method to analytically treat both the outbreak threshold and recovered population, and validate the predictions through agent-based simulations. Extensive analysis on the classical synthetic networks shows that sparsely available connections, and relatively heterogeneous degree distribution, either assortative or extremely disassortative configurations are favorable for continuous transition. In such cases, the employed network can yield a strong localization effect so that the innovation is trapped in the configurations composed of the hubs with high non-backtracking centrality. We further explore the dependence of both tricritical point and localization strength on three structural quantities: network density, heterogeneity, and assortativity, which gives a clear physical picture of the joint effects of the three structure quantities on the localization strength. Finally, we conclude that the core-periphery structure, being sensitive to the change of the three structure quantities, essentially determines localization strength, and further regulates the phase transition.
- 1 November 2021
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 588, 126558
The coupled dynamics of information dissemination and SEIR-based epidemic spreading in multiplex networks
- 1 November 2021
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 588, 126558
The coupled dynamics of information dissemination and SEIR-based epidemic spreading in multiplex networks