Searcharxiv⌕ Search

arXiv subjects

Sang Hoon Lee

Publications and source records attributed to Sang Hoon Lee.

At least 55 records · Page 3Linked to original sources
arXiv2017

Time-dependent community structure in legislation cosponsorship networks in the Congress of the Republic of Peru

We study community structure in time-dependent legislation cosponsorship networks in the Peruvian Congress, and we compare them briefly to legislation cosponsorship networks in the US Senate. To study these legislatures, we employ a multilayer representation of temporal networks in which legislators in each layer are connected to each other with a weight that is based on how many bills they cosponsor. We then use multilayer modularity maximization to detect communities in these networks. From our computations, we are able to capture power shifts in the Peruvian Congress during 2006--2011. For example, we observe the emergence of 'opportunists', who switch from one community to another, as well as cohesive legislative communities whose initial component legislators never change communities. Interestingly, many of the opportunists belong to the group that won the majority in Congress.

physics.soc-ph↗
arXiv2016

Efficiency at the maximum power output for simple two-level heat engine

We introduce a simple two-level heat engine to study the efficiency in the condition of the maximum power output, depending on the energy levels from which the net work is extracted. In contrast to the quasi-statically operated Carnot engine whose efficiency reaches the theoretical maximum, recent research on more realistic engines operated in finite time has revealed other classes of efficiency such as the Curzon-Ahlborn efficiency maximizing the power output. We investigate yet another side with our heat engine model, which consists of pure relaxation and net work extraction processes from the population difference caused by different transition rates. Due to the nature of our model, the time-dependent part is completely decoupled from the other terms in the generated work. We derive analytically the optimal condition for transition rates maximizing the generated power output and discuss its implication on general premise of realistic heat engines. In particular, the optimal engine efficiency of our model is different from the Curzon-Ahlborn efficiency, although they share the universal linear and quadratic coefficients at the near-equilibrium limit. We further confirm our results by taking an alternative approach in terms of the entropy production at hot and cold reservoirs.

cond-mat.stat-mech↗
arXiv2016

Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths

We introduce several novel and computationally efficient methods for detecting "core--periphery structure" in networks. Core--periphery structure is a type of mesoscale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices. Core vertices tend to be well-connected both among themselves and to peripheral vertices, which tend not to be well-connected to other vertices. Our first method, which is based on transportation in networks, aggregates information from many geodesic paths in a network and yields a score for each vertex that reflects the likelihood that a vertex is a core vertex. Our second method is based on a low-rank approximation of a network's adjacency matrix, which can often be expressed as a tensor-product matrix. Our third approach uses the bottom eigenvector of the random-walk Laplacian to infer a coreness score and a classification into core and peripheral vertices. We also design an objective function to (1) help classify vertices into core or peripheral vertices and (2) provide a goodness-of-fit criterion for classifications into core versus peripheral vertices. To examine the performance of our methods, we apply our algorithms to both synthetically-generated networks and a variety of networks constructed from real-world data sets.

cs.DM↗
arXiv2016

Building blocks of the basin stability of power grids

Given a power grid and a transmission (coupling) strength, basin stability is a measure of synchronization stability for individual nodes. Earlier studies have focused on the basin stability's dependence of the position of the nodes in the network for single values of transmission strength. Basin stability grows from zero to one as transmission strength increases, but often in a complex, nonmonotonous way. In this study, we investigate the entire functional form of the basin stability's dependence on transmission strength. To be able to perform a systematic analysis, we restrict ourselves to small networks. We scan all isomorphically distinct networks with an equal number of power producers and consumers of six nodes or less. We find that the shapes of the basin stability fall into a few, rather well-defined classes, that could be characterized by the number of edges and the betweenness of the nodes, whereas other network positional quantities matter less.

nlin.CD↗
arXiv2016

Network nestedness as generalized core-periphery structures

The concept of nestedness, in particular for ecological and economical networks, has been introduced as a structural characteristic of real interacting systems. We suggest that the nestedness is in fact another way to express a mesoscale network property called the core-periphery structure. With real ecological mutualistic networks and synthetic model networks, we reveal the strong correlation between the nestedness and core-periphery-ness (likeness to the core-periphery structure), by defining the network-level measures for nestedness and core-periphery-ness in the case of weighted and bipartite networks. However, at the same time, via more sophisticated null-model analysis, we also discover that the degree (the number of connected neighbors of a node) distribution poses quite severe restrictions on the possible nestedness and core-periphery parameter space. Therefore, there must exist structurally interwoven properties in more fundamental levels of network formation, behind this seemingly obvious relation between nestedness and core-periphery structures.

physics.soc-ph↗
arXiv2016

Intellectual interchanges in the history of the massive online open-editing encyclopedia, Wikipedia

Wikipedia is a free Internet encyclopedia with an enormous amount of content. This encyclopedia is written by volunteers with various backgrounds in a collective fashion; anyone can access and edit most of the articles. This open-editing nature may give us prejudice that Wikipedia is an unstable and unreliable source; yet many studies suggest that Wikipedia is even more accurate and self-consistent than traditional encyclopedias. Scholars have attempted to understand such extraordinary credibility, but usually used the number of edits as the unit of time, without consideration of real time. In this work, we probe the formation of such collective intelligence through a systematic analysis using the entire history of 34,534,110 English Wikipedia articles, between 2001 and 2014. From this massive data set, we observe the universality of both timewise and lengthwise editing scales, which suggests that it is essential to consider the real-time dynamics. By considering real time, we find the existence of distinct growth patterns that are unobserved by utilizing the number of edits as the unit of time. To account for these results, we present a mechanistic model that adopts the article editing dynamics based on both editor-editor and editor-article interactions. The model successfully generates the key properties of real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size. In addition, the model indicates that infrequently referred articles tend to grow faster than frequently referred ones, and articles attracting a high motivation to edit counterintuitively reduce the number of participants. We suggest that this decay of participants eventually brings inequality among the editors, which will become more severe with time.

physics.soc-ph↗
arXiv2015

Community consistency determines the stability transition window of power-grid nodes

The synchrony of electric power systems is important in order to maintain stable electricity supply. Recently, the measure basin stability was introduced to quantify a node's ability to recover its synchronization when perturbed. In this work, we focus on how basin stability depends on the coupling strength between nodes. We use the Chilean power grid as a case study. In general, basin stability goes from zero to one as coupling strength increases. However, this transition does not happen at the same value for different nodes. By understanding the transition for individual nodes, we can further characterize their role in the power-transmission dynamics. We find that nodes with an exceptionally large transition window also have a low community consistency. In other words, they are hard to classify to one community when applying a community detection algorithm. This also gives an efficient way to identify nodes with a long transition window (which is computationally time consuming). Finally, to corroborate these results, we present a stylized example network with prescribed community structures that captures the mentioned characteristics of basin stability transition and recreates our observations.

nlin.CD↗
arXiv2015

Treatment plan comparison of Linac step and shoot,Tomotherapy, RapidArc, and Proton therapy for prostate cancer using dosimetrical and biological index

The purpose of this study was to use various dosimetrical indices to determine the best IMRT modality technique for treating patients with prostate cancer. Ten patients with prostate cancer were included in this study. Intensity modulated radiation therapy plans were designed to include different modalities, including the linac step and shoot, Tomotherapy, RapidArc, and Proton systems. Various dosimetrical indices, like the prescription isodose to target volume (PITV) ratio, conformity index (CI), homogeneity index (HI), target coverage index (TCI), modified dose homogeneity index (MHI), conformation number (CN), critical organ scoring index (COSI), and quality factor (QF) were determined to compare the different treatment plans. Biological indices such as the generalized equivalent uniform dose (gEUD), based tumor control probability (TCP), and normal tissue complication probability (NTCP) were also calculated and used to compare the treatment plans. The RapidArc plan attained better PTV coverage, as evidenced by its superior PITV, CI, TCI, MHI, and CN values. Regarding OARs, proton therapy exhibited superior dose sparing for the rectum and bowel in low dose volumes, whereas the Tomotherapy and RapidArc plans achieved better dose sparing in high dose volumes. The QF scores showed no significant difference among these plans (p=0.701). The average TCPs for prostate tumors in the RapidArc, Linac, and Proton plans were higher than the average TCP for Tomotherapy (98.79%, 98.76%, and 98.75% vs. 98.70%, respectively). Regarding the rectum NTCP, RapidArc showed the most favorable result (0.09%), whereas Linac resulted in the best bladder NTCP (0.08%).

physics.med-ph↗
arXiv2014

Matchmaker, Matchmaker, Make Me a Match: Migration of Populations via Marriages in the Past

The study of human mobility is both of fundamental importance and of great potential value. For example, it can be leveraged to facilitate efficient city planning and improve prevention strategies when faced with epidemics. The newfound wealth of rich sources of data---including banknote flows, mobile phone records, and transportation data---has led to an explosion of attempts to characterize modern human mobility. Unfortunately, the dearth of comparable historical data makes it much more difficult to study human mobility patterns from the past. In this paper, we present an analysis of long-term human migration, which is important for processes such as urbanization and the spread of ideas. We demonstrate that the data record from Korean family books (called "jokbo") can be used to estimate migration patterns via marriages from the past 750 years. We apply two generative models of long-term human mobility to quantify the relevance of geographical information to human marriage records in the data, and we find that the wide variety in the geographical distributions of the clans poses interesting challenges for the direct application of these models. Using the different geographical distributions of clans, we quantify the "ergodicity" of clans in terms of how widely and uniformly they have spread across Korea, and we compare these results to those obtained using surname data from the Czech Republic. To examine population flow in more detail, we also construct and examine a population-flow network between regions. Based on the correlation between ergodicity and migration in Korea, we identify two different types of migration patterns: diffusive and convective. We expect the analysis of diffusive versus convective effects in population flows to be widely applicable to the study of mobility and migration patterns across different cultures.

physics.soc-ph↗
arXiv2014

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

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.

physics.soc-ph↗
arXiv2013

Exploring Maps with Greedy Navigators

During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global positioning system equipped smartphones, however, a user's ability to access local geometric information and find efficient pathways on networks plays a crucial role, rather than the globally optimal pathways. We present a simple greedy spatial navigation strategy as a probe to explore spatial networks. These greedy navigators use directional information in every move they take, without being trapped in a dead end based on their memory about previous routes. We suggest that the centralities measures have to be modified to incorporate the navigators' behavior, and present the intriguing effect of navigators' greediness where removing some edges may actually enhance the routing efficiency, which is reminiscent of Braess's paradox. In addition, using samples of road structures in large cities around the world, it is shown that the navigability measure we define reflects unique structural properties, which are not easy to predict from other topological characteristics. In this respect, we believe that our routing scheme significantly moves the routing problem on networks one step closer to reality, incorporating the inevitable incompleteness of navigators' information.

physics.soc-ph↗
arXiv2012

A greedy-navigator approach to navigable city plans

We use a set of four theoretical navigability indices for street maps to investigate the shape of the resulting street networks, if they are grown by optimizing these indices. The indices compare the performance of simulated navigators (having a partial information about the surroundings, like humans in many real situations) to the performance of optimally navigating individuals. We show that our simple greedy shortcut construction strategy generates the emerging structures that are different from real road network, but not inconceivable. The resulting city plans, for all navigation indices, share common qualitative properties such as the tendency for triangular blocks to appear, while the more quantitative features, such as degree distributions and clustering, are characteristically different depending on the type of metrics and routing strategies. We show that it is the type of metrics used which determines the overall shapes characterized by structural heterogeneity, but the routing schemes contribute to more subtle details of locality, which is more emphasized in case of unrestricted connections when the edge crossing is allowed.

physics.soc-ph↗
arXiv2012

Geometric properties of graph layouts optimized for greedy navigation

The graph layouts used for complex network studies have been mainly been developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable cue for various purposes. In this work, we focus on the navigational properties of spatial graphs. We use an recently user-centric navigation protocol to explore spatial layouts of complex networks that are optimal for navigation. These layouts are generated with a simple simulated annealing optimization technique. We compared these layouts to others targeted at better visualization. We discuss the spatial statistical properties of the optimized layouts for better navigability and its implication.

physics.soc-ph↗
arXiv2012

Neutral theory of chemical reaction networks

To what extent do the characteristic features of a chemical reaction network reflect its purpose and function? In general, one argues that correlations between specific features and specific functions are key to understanding a complex structure. However, specific features may sometimes be neutral and uncorrelated with any system-specific purpose, function or causal chain. Such neutral features are caused by chance and randomness. Here we compare two classes of chemical networks: one that has been subjected to biological evolution (the chemical reaction network of metabolism in living cells) and one that has not (the atmospheric planetary chemical reaction networks). Their degree distributions are shown to share the very same neutral system-independent features. The shape of the broad distributions is to a large extent controlled by a single parameter, the network size. From this perspective, there is little difference between atmospheric and metabolic networks; they are just different sizes of the same random assembling network. In other words, the shape of the degree distribution is a neutral characteristic feature and has no functional or evolutionary implications in itself; it is not a matter of life and death.

cond-mat.stat-mech↗
arXiv2012

Phase-shift inversion in oscillator systems with periodically switching couplings

A system's response to external periodic changes can provide crucial information about its dynamical properties. We investigate the synchronization transition, an archetypical example of a dynamic phase transition, in the framework of such a temporal response. The Kuramoto model under periodically switching interactions has the same type of phase transition as the original mean-field model. Furthermore, we see that the signature of the synchronization transition appears in the relative delay of the order parameter with respect to the phase of oscillating interactions as well. Specifically, the phase shift becomes significantly larger as the system gets closer to the phase transition so that the order parameter at the minimum interaction density can even be larger than that at the maximum interaction density, counterintuitively. We argue that this phase-shift inversion is caused by the diverging relaxation time, in a similar way to the resonance near the critical point in the kinetic Ising model. Our result, based on exhaustive simulations on globally coupled systems as well as scale-free networks, shows that an oscillator system's phase transition can be manifested in the temporal response to the topological dynamics of the underlying connection structure.

cond-mat.stat-mech↗
arXiv2011

Subnormality for arbitrary powers of 2-variable weighted shifts whose restrictions to a large invariant subspace are tensor products

The Lifting Problem for Commuting Subnormals (LPCS) asks for necessary and sufficient conditions for a pair of subnormal operators on Hilbert space to admit commuting normal extensions. \ We study LPCS within the class of commuting 2-variable weighted shifts $\mathbf{T} \equiv (T_1,T_2)$ with subnormal components $T_1$ and $T_2$, acting on the Hilbert space $\ell ^2(\mathbb{Z}^2_+)$ with canonical orthonormal basis $\{e_{(k_1,k_2)}\}_{k_1,k_2 \geq 0}$ . \ The \textit{core} of a commuting 2-variable weighted shift $\mathbf{T}$, $c(\mathbf{T})$, is the restriction of $\mathbf{T}$ to the invariant subspace generated by all vectors $e_{(k_1,k_2)}$ with $k_1,k_2 \geq 1$; we say that $c(\mathbf{T})$ is of \textit{tensor form} if it is unitarily equivalent to a shift of the form $(I \otimes W_α, W_β\otimes I)$, where $W_α$ and $W_β$ are subnormal unilateral weighted shifts. \ Given a 2-variable weighted shift $\mathbf{T}$ whose core is of tensor form, we prove that LPCS is solvable for $\mathbf{T}$ if and only if LPCS is solvable for any power $\mathbf{T}^{(m,n)}:=(T^m_1,T^n_2)$ ($m,n\geq 1$). \

math.FA↗
arXiv2011

Pathlength scaling in graphs with incomplete navigational information

The graph-navigability problem concerns how one can find as short paths as possible between a pair of vertices, given an incomplete picture of a graph. We study the navigability of graphs where the vertices are tagged by a number (between 1 and the total number of vertices) in a way to aid navigation. This information is too little to ensure errorfree navigation but enough, as we will show, for the agents to do significantly better than a random walk. In our setup, given a graph, we first assign information to the vertices that agents can utilize for their navigation. To evaluate the navigation, we calculate the average distance traveled over random pairs of source and target and different graph realizations. We show that this type of embedding can be made quite efficiently; the more information is embedded, the more efficient it gets. We also investigate the embedded navigational information in a standard graph layout algorithm and find that although this information does not make algorithms as efficient as the above-mentioned schemes, it is significantly helpful.

physics.soc-ph↗