A5100414858- Complex Network Analysis Techniques
- Opinion Dynamics and Social Influence
- Human Mobility and Location-Based Analysis
- Bioinformatics and Genomic Networks
- Opportunistic and Delay-Tolerant Networks
- Software-Defined Networks and 5G
- COVID-19 epidemiological studies
- Graph Theory and Algorithms
- Evolutionary Game Theory and Cooperation
- Theoretical and Computational Physics
- Internet Traffic Analysis and Secure E-voting
- Cholinesterase and Neurodegenerative Diseases
- Infrastructure Resilience and Vulnerability Analysis
- Complex Systems and Time Series Analysis
- Computational Drug Discovery Methods
- Graph theory and applications
- Geographic Information Systems Studies
- Spam and Phishing Detection
- Advanced Graph Neural Networks
- Cognitive and psychological constructs research
- Nonlinear Dynamics and Pattern Formation
- Ecosystem dynamics and resilience
- Face and Expression Recognition
- Privacy-Preserving Technologies in Data
- Advanced MIMO Systems Optimization
Beijing Normal University
2021-2025
Wuhan University of Science and Technology
2025
Potsdam Institute for Climate Impact Research
2024-2025
Humboldt-Universität zu Berlin
2023
Beijing University of Chemical Technology
2023
Ministry of Natural Resources
2023
China University of Geosciences (Beijing)
2023
Institutes of Science and Development
2023
Chinese Academy of Sciences
2023
Ocean University of China
2020
The family of Vicsek fractals is one the most important and frequently studied regular fractal classes, it considerable interest to understand dynamical processes on this treelike family. In paper, we investigate discrete random walks fractals, with aim obtain exact solutions global mean-first-passage time (GMFPT), defined as average first-passage (FPT) between two nodes over whole fractals. Based known connections FPTs, effective resistance, eigenvalues graph Laplacian, determine implicitly...
Many real complex systems, such as infrastructure and the Internet, are not random but embedded in a metric space. The problem of spatial network disintegration, or critical area identification, is fundamental research domain science has received increasing attention. Typical applications include immunization, epidemic control, early warning signals disintegration. Due to computationally challenging (NP-hard) problem, they usually cannot be solved with polynomial algorithms. Here, we propose...
Finding an optimal strategy at a minimum cost to efficiently disintegrate harmful network into isolated components is important and interesting problem, with applications in particular anti-terrorism measures epidemic control. This paper focuses on disintegration strategies for spatial networks, aiming find appropriate set of nodes or links whose removal would result maximal fragmentation. We refer the sum degree number specific region as centrality. metric provides comprehensive account...
Correlation analysis serves as an easy-to-implement estimation approach for the quantification of interaction or connectivity between different units. Often, pairwise correlations estimated by sliding windows are time-varying (on window segments) and size-dependent sizes). Still, how to choose appropriate size remains unclear. This paper offers a framework studying this fundamental question observing critical transition from chaotic-like state nonchaotic state. Specifically, given two time...
An effective and stable operation of an economic system leads to a prosperous society sustainable world development. Unfortunately, the faces inevitable perturbations extreme events is frequently damaged. To maintain system's stability, recovering its damaged functionality essential complementary strengthening resilience forecasting events. This paper proposes target recovery method based on network equilibrium theories defend against characterized as localized attacks. novel stimulates set...
Abstract We live in a hyperconnected world---connectivity that can sometimes be detrimental. Finding an optimal subset of nodes or links to disintegrate harmful networks is fundamental problem network science, with potential applications anti-terrorism, epidemic control, and many other fields study. The challenge the disintegration balance effectiveness efficiency strategies. In this paper, we propose cost-effective targeted enumeration method for disintegration. proposed approach includes...
Abstract We live in a hyperconnected world---connectivity that can sometimes be detrimental. Finding an optimal subset of nodes or links to disintegrate harmful networks is fundamental problem network science, with potential applications anti-terrorism, epidemic control, and many other fields study. The challenge the disintegration balance effectiveness efficiency strategies. In this paper, we propose cost-effective targeted enumeration method for disintegration. proposed approach includes...
Finding an optimal subset of nodes or links to disintegrate harmful networks is a fundamental problem in network science, with potential applications anti-terrorism, epidemic control, and many other fields study. The challenge the disintegration balance effectiveness efficiency strategies. In this paper, we propose cost-effective targeted enumeration method for disintegration. proposed approach includes two stages: searching candidate objects identifying solution. first stage, use rank...