Xiaolei Ru
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaolei Ru has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Jack Murdoch Moore
Tongji University
5 shared publications - Gang Yan
Tongji University
4 shared publications - Xin-Ya Zhang
Center for Interdisciplinary Studies and Department of Physics, School of Science, Westlake University, Hangzhou, People’s Republic of China
3 shared publications - Zijia Liu
School of Physical Science and Engineering, Tongji University, Shanghai 200092, People’s Republic of China
3 shared publications - Changgui Gu
University of Shanghai for Science and Technology
1 shared publication - Haiying Wang
University of Shanghai for Science and Technology
1 shared publication
Latest Publications
- Open Access
- 1 October 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (10)
Inferring stochastic dynamics from incomplete observations of network spreading processes
Inferring the dynamics of infectious diseases enables prediction and intervention. During early monitoring, available information may comprise digital contact data that partly resolve the interaction network and intermittent screening data that leave the states of some nodes unresolved. Learning-based methods can introduce further information loss by compressing available network and state information into summary statistics. To retain the correspondence between node states and network positions, we develop Graph-Sequence Transformer Attention (GTA), which uses observed node states, network topology, and observation times to infer infection and recovery probabilities for susceptible–infectious–recovered spreading. We compare GTA with summary-based XGBoost and a one-dimensional convolutional neural network and with maximum-likelihood estimation of the recovery probability. Across four synthetic network classes and five empirical topologies, the three learning methods often perform comparably and respond similarly to changes in network size, mean degree, and observation timing. GTA is usually most accurate for estimating infection on sparse, heterogeneous networks, whereas summary-based methods often match or outperform it on denser, more homogeneous networks. For a fixed number of observations, wider spacing can initially improve inference by covering more of the spreading trajectory, but eventually increases error as intermediate transitions are missed. Maximum-likelihood estimation can outperform learning methods when recovery transitions are well resolved, but deteriorates as observations become more widely separated. Losing information about node states can compromise performance more than losing information about edges. Overall, the results show how inference from incomplete observations depends on network structure, temporal sampling, and the information retained in the observations.
- 1 October 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (10)
Open AccessInferring stochastic dynamics from incomplete observations of network spreading processes
Inferring the dynamics of infectious diseases enables prediction and intervention. During early monitoring, available information may comprise digital contact data that partly resolve the interaction network and intermittent screening data that leave the states of some nodes unresolved. Learning-based methods can introduce further information loss by compressing available network and state information into summary statistics. To retain the correspondence between node states and network positions, we develop Graph-Sequence Transformer Attention (GTA), which uses observed node states, network topology, and observation times to infer infection and recovery probabilities for susceptible–infectious–recovered spreading. We compare GTA with summary-based XGBoost and a one-dimensional convolutional neural network and with maximum-likelihood estimation of the recovery probability. Across four synthetic network classes and five empirical topologies, the three learning methods often perform comparably and respond similarly to changes in network size, mean degree, and observation timing. GTA is usually most accurate for estimating infection on sparse, heterogeneous networks, whereas summary-based methods often match or outperform it on denser, more homogeneous networks. For a fixed number of observations, wider spacing can initially improve inference by covering more of the spreading trajectory, but eventually increases error as intermediate transitions are missed. Maximum-likelihood estimation can outperform learning methods when recovery transitions are well resolved, but deteriorates as observations become more widely separated. Losing information about node states can compromise performance more than losing information about edges. Overall, the results show how inference from incomplete observations depends on network structure, temporal sampling, and the information retained in the observations.
- Open Access
- 1 December 2025
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (4) , 045014
Coarse-graining complex networks by optimizing mutual information estimates of random walks
We leverage information theory to develop a novel method of structural coarse-graining for unfolding complex networks across multiple scales, enabling further investigations into multi-scale phenomena. The approach utilizes slow dynamics of random walks on graphs, in which the short-term behavior manifests as movement between individual nodes whereas the long-term behavior, governed by the slow-timescale features, comprises moving between clusters. Specifically, the slow-timescale features are obtained by embedding the walk trajectory into a hidden space to maximize mutual information between historical observations separated by a given time-span. The coarse-grained structures are obtained through aggregating nodes in this hidden space, and exhibit more macroscopic properties as the time-span increases. Our method provides greater control over the resolution of the resultant network. Our results demonstrate that the proposed approach (a) clearly reveals hierarchical community structures in scientific collaboration networks, and (b) illuminates structural and dynamical self-similarity in the human connectome. In addition, we derive an analytic formula for mutual information between the current and historical state of a random walk on a given complex network, which allows us to demonstrate the superiority of neural estimators in determining the mutual information between discrete time series. As well as providing a flexible tool for structural coarse-graining, our work illustrates the practical advantages of neural network-based estimators of information theoretic quantities for addressing problems in network science.
- 1 December 2025
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (4) , 045014
Open AccessCoarse-graining complex networks by optimizing mutual information estimates of random walks
We leverage information theory to develop a novel method of structural coarse-graining for unfolding complex networks across multiple scales, enabling further investigations into multi-scale phenomena. The approach utilizes slow dynamics of random walks on graphs, in which the short-term behavior manifests as movement between individual nodes whereas the long-term behavior, governed by the slow-timescale features, comprises moving between clusters. Specifically, the slow-timescale features are obtained by embedding the walk trajectory into a hidden space to maximize mutual information between historical observations separated by a given time-span. The coarse-grained structures are obtained through aggregating nodes in this hidden space, and exhibit more macroscopic properties as the time-span increases. Our method provides greater control over the resolution of the resultant network. Our results demonstrate that the proposed approach (a) clearly reveals hierarchical community structures in scientific collaboration networks, and (b) illuminates structural and dynamical self-similarity in the human connectome. In addition, we derive an analytic formula for mutual information between the current and historical state of a random walk on a given complex network, which allows us to demonstrate the superiority of neural estimators in determining the mutual information between discrete time series. As well as providing a flexible tool for structural coarse-graining, our work illustrates the practical advantages of neural network-based estimators of information theoretic quantities for addressing problems in network science.
- Open Access
- 21 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (6) , 5943-5953
Mixup in Latent Geometry for Graph Classification
Mixup is a data augmentation method which can interpolate between existing data to create new samples. By enlarging the training distribution, it reduces the risk of overfitting and improves generalization. Mixup is relatively straightforward to apply to image samples because pixels with equivalent coordinates in different images can be associated. However, alignment of distinct graphs with different sizes is non-trivial, thereby hindering the application of Mixup to graph data. Here we develop a novel algorithm to address this issue by exploiting the latent hyperbolic geometry which has been shown to underlie many real-world graphs. By considering global graph structure similarity and several fundamental structural features of graph models, we demonstrate that our mixup scheme leads to synthetic graphs whose structural features approximate the linear interpolation of parent graphs, a property important for avoiding the generation of mislabeled synthetic data. We apply the proposed algorithm to classify empirical graphs, and the results show that it improves classification performance on all six benchmark datasets and significantly enhances the generalization ability and robustness of graph neural networks.
- 21 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (6) , 5943-5953
Open AccessMixup in Latent Geometry for Graph Classification
Mixup is a data augmentation method which can interpolate between existing data to create new samples. By enlarging the training distribution, it reduces the risk of overfitting and improves generalization. Mixup is relatively straightforward to apply to image samples because pixels with equivalent coordinates in different images can be associated. However, alignment of distinct graphs with different sizes is non-trivial, thereby hindering the application of Mixup to graph data. Here we develop a novel algorithm to address this issue by exploiting the latent hyperbolic geometry which has been shown to underlie many real-world graphs. By considering global graph structure similarity and several fundamental structural features of graph models, we demonstrate that our mixup scheme leads to synthetic graphs whose structural features approximate the linear interpolation of parent graphs, a property important for avoiding the generation of mislabeled synthetic data. We apply the proposed algorithm to classify empirical graphs, and the results show that it improves classification performance on all six benchmark datasets and significantly enhances the generalization ability and robustness of graph neural networks.
- 23 September 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (13) , 138401
Geometric Scaling Law in Real Neuronal Networks
We investigate the synapse-resolution connectomes of fruit flies across different developmental stages, revealing a consistent scaling law in neuronal connection probability relative to spatial distance. This power-law behavior significantly differs from the exponential distance rule previously observed in coarse-grained brain networks. We demonstrate that the geometric scaling law carries functional significance, aligning with the maximum entropy of information communication and the functional criticality balancing integration and segregation. Perturbing either the empirical probability model’s parameters or its type results in the loss of these advantageous properties. Furthermore, we derive an explicit quantitative predictor for neuronal connectivity, incorporating only interneuronal distance and neurons’ in and out degrees. Our findings establish a direct link between brain geometry and topology, shedding lights on the understanding of how the brain operates optimally within its confined space.
- 23 September 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (13) , 138401
Geometric Scaling Law in Real Neuronal Networks
We investigate the synapse-resolution connectomes of fruit flies across different developmental stages, revealing a consistent scaling law in neuronal connection probability relative to spatial distance. This power-law behavior significantly differs from the exponential distance rule previously observed in coarse-grained brain networks. We demonstrate that the geometric scaling law carries functional significance, aligning with the maximum entropy of information communication and the functional criticality balancing integration and segregation. Perturbing either the empirical probability model’s parameters or its type results in the loss of these advantageous properties. Furthermore, we derive an explicit quantitative predictor for neuronal connectivity, incorporating only interneuronal distance and neurons’ in and out degrees. Our findings establish a direct link between brain geometry and topology, shedding lights on the understanding of how the brain operates optimally within its confined space.
- Top Cited PapersOpen Access
- 15 July 2024
- Published by American Physical Society (APS) in Physical Review X
- Vol. 14 (3) , 031009
Early Predictor for the Onset of Critical Transitions in Networked Dynamical Systems
Numerous natural and human-made systems exhibit critical transitions whereby slow changes in environmental conditions spark abrupt shifts to a qualitatively distinct state. These shifts very often entail severe consequences; therefore, it is imperative to devise robust and informative approaches for anticipating the onset of critical transitions. Real-world complex systems can comprise hundreds or thousands of interacting entities, and implementing prevention or management strategies for critical transitions requires knowledge of the exact condition in which they will manifest. However, most research so far has focused on low-dimensional systems and small networks containing fewer than ten nodes or has not provided an estimate of the location where the transition will occur. We address these weaknesses by developing a deep-learning framework which can predict the specific location where critical transitions happen in networked systems with size up to hundreds of nodes. These predictions do not rely on the network topology, the edge weights, or the knowledge of system dynamics. We validate the effectiveness of our machine-learning-based framework by considering a diverse selection of systems representing both smooth (second-order) and explosive (first-order) transitions: the synchronization transition in coupled Kuramoto oscillators; the sharp decline in the resource biomass present in an ecosystem; and the abrupt collapse of a Wilson-Cowan neuronal system. We show that our method provides accurate predictions for the onset of critical transitions well in advance of their occurrences, is robust to noise and transient data, and relies only on observations of a small fraction of nodes. Finally, we demonstrate the applicability of our approach to real-world systems by considering empirical vegetated ecosystems in Africa. Published by the American Physical Society 2024
- 15 July 2024
- Published by American Physical Society (APS) in Physical Review X
- Vol. 14 (3) , 031009
Top Cited PapersOpen AccessEarly Predictor for the Onset of Critical Transitions in Networked Dynamical Systems
Numerous natural and human-made systems exhibit critical transitions whereby slow changes in environmental conditions spark abrupt shifts to a qualitatively distinct state. These shifts very often entail severe consequences; therefore, it is imperative to devise robust and informative approaches for anticipating the onset of critical transitions. Real-world complex systems can comprise hundreds or thousands of interacting entities, and implementing prevention or management strategies for critical transitions requires knowledge of the exact condition in which they will manifest. However, most research so far has focused on low-dimensional systems and small networks containing fewer than ten nodes or has not provided an estimate of the location where the transition will occur. We address these weaknesses by developing a deep-learning framework which can predict the specific location where critical transitions happen in networked systems with size up to hundreds of nodes. These predictions do not rely on the network topology, the edge weights, or the knowledge of system dynamics. We validate the effectiveness of our machine-learning-based framework by considering a diverse selection of systems representing both smooth (second-order) and explosive (first-order) transitions: the synchronization transition in coupled Kuramoto oscillators; the sharp decline in the resource biomass present in an ecosystem; and the abrupt collapse of a Wilson-Cowan neuronal system. We show that our method provides accurate predictions for the onset of critical transitions well in advance of their occurrences, is robust to noise and transient data, and relies only on observations of a small fraction of nodes. Finally, we demonstrate the applicability of our approach to real-world systems by considering empirical vegetated ecosystems in Africa. Published by the American Physical Society 2024