Hanlin Sun

Dr. Hanlin Sun


Research Focus & Metrics

Representative Publications

View All Publications
6 October 2021 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
GSGuillaume St-Onge
Guillaume St-Onge
HSHanlin Sun
Hanlin Sun
AAAntoine Allard
Antoine Allard
LHLaurent Hébert-Dufresne
Laurent Hébert-Dufresne
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
The collocation of individuals in different environments is an important prerequisite for exposure to infectious diseases on a social network. Standard epidemic models fail to capture the potential complexity of this scenario by (1) neglecting the higher-order structure of contacts that typically occur through environments like workplaces, restaurants, and households, and (2) assuming a linear relationship between the exposure to infected contacts and the risk of infection. Here, we leverage a hypergraph model to embrace the heterogeneity of environments and the heterogeneity of individual participation in these environments. We find that combining heterogeneous exposure with the concept of minimal infective dose induces a universal nonlinear relationship between infected contacts and infection risk. Under nonlinear infection kernels, conventional epidemic wisdom breaks down with the emergence of discontinuous transitions, superexponential spread, and hysteresis.

15 September 2021 in Physical Review E
Verified
Journal Article
Closed access
PDF file
HSHanlin Sun
Hanlin Sun
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
Higher-order interactions are increasingly recognized as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraphs as well as simplicial complexes capture the higher-order interactions of complex systems and allow us to investigate the relation between their higher-order structure and their function. Here we establish a general framework for assessing hypergraph robustness and we characterize the critical properties of simple and higher-order percolation processes. This general framework builds on the formulation of the random multiplex hypergraph ensemble where each layer is characterized by hyperedges of given cardinality. We observe that in presence of the structural cutoff the ensemble of multiplex hypergraphs can be mapped to an ensemble of multiplex bipartite networks. We reveal the relation between higher-order percolation processes in random multiplex hypergraphs, interdependent percolation of multiplex networks, and K-core percolation. The structural correlations of the random multiplex hypergraphs are shown to have a significant effect on their percolation properties. The wide range of critical behaviors observed for higher-order percolation processes on multiplex hypergraphs elucidates the mechanisms responsible for the emergence of discontinuous transition and uncovers interesting critical properties which can be applied to the study of epidemic spreading and contagion processes on higher-order networks.

19 February 2025 in Nature Physics
Verified
Journal Article
Closed access
PDF file
AMAna P. Millán
Ana P. Millán
HSHanlin Sun
Hanlin Sun
LGLorenzo Giambagli
Lorenzo Giambagli
Riccardo MuoloRiccardo Muolo
Riccardo Muolo
Timoteo CarlettiTimoteo Carletti
Timoteo Carletti
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi

10 March 2023 in Nature Communications
Verified
Journal Article
Open access
PDF file
HSHanlin Sun
Hanlin Sun
FRFilippo Radicchi
Filippo Radicchi
JKJürgen Kurths
Jürgen Kurths
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex networks, the percolation transition can become discontinuous. However, little is known about percolation in networks with higher-order interactions. Here, we show that percolation can be turned into a fully fledged dynamical process when higher-order interactions are taken into account. By introducing signed triadic interactions, in which a node can regulate the interactions between two other nodes, we define triadic percolation. We uncover that in this paradigmatic model the connectivity of the network changes in time and that the order parameter undergoes a period doubling and a route to chaos. We provide a general theory for triadic percolation which accurately predicts the full phase diagram on random graphs as confirmed by extensive numerical simulations. We find that triadic percolation on real network topologies reveals a similar phenomenology. These results radically change our understanding of percolation and may be used to study complex systems in which the functional connectivity is changing in time dynamically and in a non-trivial way, such as in neural and climate networks.

8 February 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
HSHanlin Sun
Hanlin Sun
GRGiacomo Rapisardi
Giacomo Rapisardi
AAAlex Arenas
Alex Arenas
With the hit of new pandemic threats, scientific frameworks are needed to understand the unfolding of the epidemic. The use of mobile apps that are able to trace contacts is of utmost importance in order to control new infected cases and contain further propagation. Here we present a theoretical approach using both percolation and message-passing techniques, to the role of contact tracing, in mitigating an epidemic wave. We show how the increase of the app adoption level raises the value of the epidemic threshold, which is eventually maximized when high-degree nodes are preferentially targeted. Analytical results are compared with extensive Monte Carlo simulations showing good agreement for both homogeneous and heterogeneous networks. These results are important to quantify the level of adoption needed for contact-tracing apps to be effective in mitigating an epidemic.

10 March 2021 in Physical Review X
Verified
Journal Article
Open access
PDF file
HSHanlin Sun
Hanlin Sun
DSDavid Saad
David Saad
ALAndrey Y. Lokhov
Andrey Y. Lokhov
Competition and collaboration are at the heart of multiagent probabilistic spreading processes. The battle for public opinion and competitive marketing campaigns are typical examples of the former, while the joint spread of multiple diseases such as HIV and tuberculosis demonstrates the latter. These spreads are influenced by the underlying network topology, the infection rates between network constituents, recovery rates, and, equally important, the interactions between the spreading processes themselves. Here, for the first time, we derive dynamic message-passing equations that provide an exact description of the dynamics of two, interacting, unidirectional spreading processes on tree graphs, and we develop systematic low-complexity models that predict the spread on general graphs. We also develop a theoretical framework for the optimal control of interacting spreading processes through optimized resource allocation under budget constraints and within a finite time window. Derived algorithms can be used to maximize the desired spread in the presence of a rival competitive process and to limit the spread through vaccination in the case of coupled infectious diseases. We demonstrate the efficacy of the framework and optimization method on both synthetic and real-world networks.