Sang Hoon Lee
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
Research Subjects
Research Interests
Sang Hoon Lee has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Heetae Kim
Department of Energy Engineering, Korea Institute of Energy Technology, Naju, Republic of Korea
7 shared publications - Ludvig Lizana
Integrated Science Lab, Department of Physics, Umeå University, Umeå, Sweden
6 shared publications - Deok-Sun Lee
Korea Institute for Advanced Study
5 shared publications - Hye Jin Park
Inha University
4 shared publications - Seung-Woo Son
Department of Applied Artificial Intelligence Hanyang University 15588 Ansan Korea
4 shared publications - Beom Jun Kim
Department of Physics, Sungkyunkwan University, Suwon, Republic of Korea
3 shared publications
Latest Publications
- 5 November 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (5)
Ecological networks of viable species with degree-dependent interaction
- 5 November 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (5)
Ecological networks of viable species with degree-dependent interaction
- 28 September 2026
- Published by Springer Nature in Journal of the Korean Physical Society
- p. 1-13
Effects of relational graph modularity and depth on the learning performance of neural networks
- 28 September 2026
- Published by Springer Nature in Journal of the Korean Physical Society
- p. 1-13
Effects of relational graph modularity and depth on the learning performance of neural networks
- Open Access
- 15 August 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Evaluating the impact of incomplete contact tracing data on urban epidemic dynamics
- 15 August 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessEvaluating the impact of incomplete contact tracing data on urban epidemic dynamics
- Open Access
The missing links: Evaluating contact tracing with incomplete data in large metropolitan areas during an epidemic
Contact tracing (CT) plays a pivotal role in controlling early epidemic spread, particularly when a novel infectious disease emerges. However, the quantitative impact of missing information -- such as untraced cases or unnotified contacts -- on the effectiveness of CT remains insufficiently understood. Using a stochastic agent-based model with sociodemographics from metropolitan areas in South Korea, we simulate how different forms of information loss affect epidemic spreading dynamics. We construct information-loss scenarios based on two types: infector-omission (IO) and contact-omission (CO), including selective (SCO) and uniform (UCO) scenarios; IO corresponds to the omission of infected individuals (nodes) from the tracing process, leading to the loss of all movement trajectories and downstream transmission links originating from them, whereas CO corresponds to the omission of specific contact events (edges), in which infected individuals are identified but some of their transmission links fail to be detected or notified. The sensitivity of epidemic dynamics to increasing omission rates differs markedly between the two types: IO scenarios exhibit substantially stronger and more abrupt changes in transmission structure and epidemic outcomes, whereas CO scenarios produce more gradual effects. In both scenarios, the magnitude of these effects varies across cities, with a lower-population city (Busan) showing greater tolerance to information loss than the largest city (Seoul), underscoring the importance of regional tailoring in CT strategies. Both IO and CO scenarios also lead to an increase in the transmission network diameter as information loss grows, indicating that a small network diameter reflects effective contact tracing that limits the depth of transmission chains.
Open AccessThe missing links: Evaluating contact tracing with incomplete data in large metropolitan areas during an epidemic
Contact tracing (CT) plays a pivotal role in controlling early epidemic spread, particularly when a novel infectious disease emerges. However, the quantitative impact of missing information -- such as untraced cases or unnotified contacts -- on the effectiveness of CT remains insufficiently understood. Using a stochastic agent-based model with sociodemographics from metropolitan areas in South Korea, we simulate how different forms of information loss affect epidemic spreading dynamics. We construct information-loss scenarios based on two types: infector-omission (IO) and contact-omission (CO), including selective (SCO) and uniform (UCO) scenarios; IO corresponds to the omission of infected individuals (nodes) from the tracing process, leading to the loss of all movement trajectories and downstream transmission links originating from them, whereas CO corresponds to the omission of specific contact events (edges), in which infected individuals are identified but some of their transmission links fail to be detected or notified. The sensitivity of epidemic dynamics to increasing omission rates differs markedly between the two types: IO scenarios exhibit substantially stronger and more abrupt changes in transmission structure and epidemic outcomes, whereas CO scenarios produce more gradual effects. In both scenarios, the magnitude of these effects varies across cities, with a lower-population city (Busan) showing greater tolerance to information loss than the largest city (Seoul), underscoring the importance of regional tailoring in CT strategies. Both IO and CO scenarios also lead to an increase in the transmission network diameter as information loss grows, indicating that a small network diameter reflects effective contact tracing that limits the depth of transmission chains.
- 14 January 2026
- Published by Springer Nature in Journal of the Korean Physical Society
- Vol. 88 (8) , 890-897
Friendship-paradox paradox: do most people’s friends really have more friends than they do?
- 14 January 2026
- Published by Springer Nature in Journal of the Korean Physical Society
- Vol. 88 (8) , 890-897
Friendship-paradox paradox: do most people’s friends really have more friends than they do?
- Open Access
- 25 July 2025
- Published by Springer Nature in EPJ Data Science
- Vol. 14 (1) , 1-19
Quantifying interdisciplinary synergy in higher STEM education
- 25 July 2025
- Published by Springer Nature in EPJ Data Science
- Vol. 14 (1) , 1-19
Open AccessQuantifying interdisciplinary synergy in higher STEM education
- Open Access
Effects of structural properties of neural networks on machine learning performance
In recent years, graph-based machine learning techniques, such as reinforcement learning and graph neural networks, have garnered significant attention. While some recent studies have started to explore the relationship between the graph structure of neural networks and their predictive performance, they often limit themselves to a narrow range of model networks, particularly lacking mesoscale structures such as communities. Our work advances this area by conducting a more comprehensive investigation, incorporating realistic network structures characterized by heterogeneous degree distributions and community structures, which are typical characteristics of many real networks. These community structures offer a nuanced perspective on network architecture. Our analysis employs model networks such as random and scale-free networks, alongside a comparison with a biological neural network and its subsets for more detailed analysis. We examine the impact of these structural attributes on the performance of image classification tasks. Our findings reveal that structural properties do affect performance to some extent. Specifically, networks featuring coherent, densely interconnected communities demonstrate enhanced learning capabilities. The comparison with the biological neural network emphasizes the relevance of our findings to real-world structures, suggesting an intriguing connection worth further exploration. This study contributes meaningfully to network science and machine learning, providing insights that could inspire the design of more biologically informed neural networks.
Open AccessEffects of structural properties of neural networks on machine learning performance
In recent years, graph-based machine learning techniques, such as reinforcement learning and graph neural networks, have garnered significant attention. While some recent studies have started to explore the relationship between the graph structure of neural networks and their predictive performance, they often limit themselves to a narrow range of model networks, particularly lacking mesoscale structures such as communities. Our work advances this area by conducting a more comprehensive investigation, incorporating realistic network structures characterized by heterogeneous degree distributions and community structures, which are typical characteristics of many real networks. These community structures offer a nuanced perspective on network architecture. Our analysis employs model networks such as random and scale-free networks, alongside a comparison with a biological neural network and its subsets for more detailed analysis. We examine the impact of these structural attributes on the performance of image classification tasks. Our findings reveal that structural properties do affect performance to some extent. Specifically, networks featuring coherent, densely interconnected communities demonstrate enhanced learning capabilities. The comparison with the biological neural network emphasizes the relevance of our findings to real-world structures, suggesting an intriguing connection worth further exploration. This study contributes meaningfully to network science and machine learning, providing insights that could inspire the design of more biologically informed neural networks.
- Open Access
- 12 May 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 054302
Global decomposition of networks into multiple cores formed by local hubs
Networks are ubiquitous in various fields, representing systems where nodes and their interconnections constitute their intricate structures. We introduce a network decomposition scheme to reveal multiscale core-periphery structures lurking inside, using the concept of locally defined nodal hub centrality and edge-pruning techniques built upon it. We demonstrate that the hub-centrality-based edge pruning reveals a series of breaking points in network decomposition, which effectively separates a network into its backbone and shell structures. Our local-edge decomposition method iteratively identifies and removes locally least connected nodes, and uncovers an onionlike hierarchical structure as a result. Compared with the conventional k -core decomposition method, our method based on relative information residing in local structures exhibits a clear advantage in terms of discovering locally crucial substructures. As an application of the method, we present a scheme to detect multiple core-periphery structures and the decomposition of coarse-grained supernode networks, by combining the method with the network community detection. Published by the American Physical Society 2025
- 12 May 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 054302
Open AccessGlobal decomposition of networks into multiple cores formed by local hubs
Networks are ubiquitous in various fields, representing systems where nodes and their interconnections constitute their intricate structures. We introduce a network decomposition scheme to reveal multiscale core-periphery structures lurking inside, using the concept of locally defined nodal hub centrality and edge-pruning techniques built upon it. We demonstrate that the hub-centrality-based edge pruning reveals a series of breaking points in network decomposition, which effectively separates a network into its backbone and shell structures. Our local-edge decomposition method iteratively identifies and removes locally least connected nodes, and uncovers an onionlike hierarchical structure as a result. Compared with the conventional k -core decomposition method, our method based on relative information residing in local structures exhibits a clear advantage in terms of discovering locally crucial substructures. As an application of the method, we present a scheme to detect multiple core-periphery structures and the decomposition of coarse-grained supernode networks, by combining the method with the network community detection. Published by the American Physical Society 2025
- 21 January 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (1) , 014312
Kaleidoscopic reorganization of network communities across different scales
The notion of structural heterogeneity is pervasive in real networks, and their community organization is no exception. Still, a vast majority of community detection methods assume neatly hierarchically organized communities of a characteristic scale for a given hierarchical level. In this work, we demonstrate that the reality of scale-dependent community reorganization is convoluted with simultaneous processes of community splitting and merging, challenging the conventional understanding of community-scale adjustment. We provide a mathematical argument concerning the modularity function, the results from real-network analysis, and a simple network model for a comprehensive understanding of the nontrivial community reorganization process. The reorganization is characterized by a local drop in the number of communities as the resolution parameter varies. This study suggests a need for a paradigm shift in the study of network communities, which emphasizes the importance of considering scale-dependent reorganization to better understand the genuine structural organization of networks.
- 21 January 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (1) , 014312
Kaleidoscopic reorganization of network communities across different scales
The notion of structural heterogeneity is pervasive in real networks, and their community organization is no exception. Still, a vast majority of community detection methods assume neatly hierarchically organized communities of a characteristic scale for a given hierarchical level. In this work, we demonstrate that the reality of scale-dependent community reorganization is convoluted with simultaneous processes of community splitting and merging, challenging the conventional understanding of community-scale adjustment. We provide a mathematical argument concerning the modularity function, the results from real-network analysis, and a simple network model for a comprehensive understanding of the nontrivial community reorganization process. The reorganization is characterized by a local drop in the number of communities as the resolution parameter varies. This study suggests a need for a paradigm shift in the study of network communities, which emphasizes the importance of considering scale-dependent reorganization to better understand the genuine structural organization of networks.
- 24 December 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (6) , 064316
Renormalization of complex networks with partition functions
While renormalization groups are fundamental in physics, renormalization of complex networks remains vague in its conceptual definition and methodology. Here, we propose a novel strategy to renormalize complex networks. Rather than resorting to handling the bare structure of a network, we overlay it with a readily renormalizable physical model, which reflects real-world scenarios with a broad generality. From the renormalization of the overlying system, we extract a rigorous and simple renormalization group transformation of arbitrary networks. In this way, we obtain a transparent, model-dependent physical meaning of the network renormalization, which in our case is a scale transformation preserving the transition dynamics of low-density particles. We define the strength of a node in accordance with the physical model and trace the change of its distribution under our renormalization process. This analysis demonstrates that the strength distributions of scale-free networks remain scale-invariant, whereas those of homogeneous random networks do not.
- 24 December 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (6) , 064316
Renormalization of complex networks with partition functions
While renormalization groups are fundamental in physics, renormalization of complex networks remains vague in its conceptual definition and methodology. Here, we propose a novel strategy to renormalize complex networks. Rather than resorting to handling the bare structure of a network, we overlay it with a readily renormalizable physical model, which reflects real-world scenarios with a broad generality. From the renormalization of the overlying system, we extract a rigorous and simple renormalization group transformation of arbitrary networks. In this way, we obtain a transparent, model-dependent physical meaning of the network renormalization, which in our case is a scale transformation preserving the transition dynamics of low-density particles. We define the strength of a node in accordance with the physical model and trace the change of its distribution under our renormalization process. This analysis demonstrates that the strength distributions of scale-free networks remain scale-invariant, whereas those of homogeneous random networks do not.