SLSang Hoon Lee

Sang Hoon Lee

*This is an algorithmically generated author record based on publicly available information.

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


Sang Hoon Lee has a total of 4 co-authors. Here are the top co-authors by number of shared publications:

  • Mason A. Porter

    Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute University of Oxford OX2 6GG United Kingdom

    2 shared publications
  • Mihai Cucuringu

    Program in Applied and Computational Mathematics (PACM) Princeton University Fine Hall Washington Road 08544-1000 Princeton New Jersey USA

    1 shared publication
  • Mihai Cucuringu

    Department of Mathematics, University of California, Los Angeles, Los Angeles, USA

    1 shared publication
  • Petter Holme

    Department of Computer Science, Aalto University, Espoo, Finland

    1 shared publication

Latest Publications

  • Open Access

    Density-based and transport-based core-periphery structures in networks

    by Sang Hoon Lee, Mihai Cucuringu, Mason A. Porter

    Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks---including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

  • Density-based and transport-based core-periphery structures in networks

    by Sang Hoon Lee, Mihai Cucuringu, Mason A. Porter

    Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks\char22{}including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.