Searcharxiv⌕ Search

arXiv subjects

Sang Hoon Lee

Publications and source records attributed to Sang Hoon Lee.

68 records · Page 4Linked to original sources
arXiv2011

Global organization of protein complexome in the yeast Saccharomyces cerevisiae

Proteins in organisms, rather than act alone, usually form protein complexes to perform cellular functions. We analyze the topological network structure of protein complexes and their component proteins in the budding yeast in terms of the bipartite network and its projections, where the complexes and proteins are its two distinct components. Compared to conventional protein-protein interaction networks, the networks from the protein complexes show more homogeneous structures than those of the binary protein interactions, implying the formation of complexes that cause a relatively more uniform number of interaction partners. In addition, we suggest a new optimization method to determine the abundance and function of protein complexes, based on the information of their global organization. Estimating abundance and biological functions is of great importance for many researches, by providing a quantitative description of cell behaviors, instead of just a "catalogues" of the lists of protein interactions. With our new optimization method, we present genome-wide assignments of abundance and biological functions for complexes, as well as previously unknown abundance and functions of proteins, which can provide significant information for further investigations in proteomics. It is strongly supported by a number of biologically relevant examples, such as the relationship between the cytoskeleton proteins and signal transduction and the metabolic enzyme Eno2's involvement in the cell division process. We believe that our methods and findings are applicable not only to the specific area of proteomics, but also to much broader areas of systems biology with the concept of optimization principle.

q-bio.QM↗
arXiv2011

Atmospheric reaction systems as null-models to identify structural traces of evolution in metabolism

The metabolism is the motor behind the biological complexity of an organism. One problem of characterizing its large-scale structure is that it is hard to know what to compare it to. All chemical reaction systems are shaped by the same physics that gives molecules their stability and affinity to react. These fundamental factors cannot be captured by standard null-models based on randomization. The unique property of organismal metabolism is that it is controlled, to some extent, by an enzymatic machinery that is subject to evolution. In this paper, we explore the possibility that reaction systems of planetary atmospheres can serve as a null-model against which we can define metabolic structure and trace the influence of evolution. We find that the two types of data can be distinguished by their respective degree distributions. This is especially clear when looking at the degree distribution of the reaction network (of reaction connected to each other if they involve the same molecular species). For the Earth's atmospheric network and the human metabolic network, we look into more detail for an underlying explanation of this deviation. However, we cannot pinpoint a single cause of the difference, rather there are several concurrent factors. By examining quantities relating to the modular-functional organization of the metabolism, we confirm that metabolic networks have a more complex modular organization than the atmospheric networks, but not much more. We interpret the more variegated modular arrangement of metabolism as a trace of evolved functionality. On the other hand, it is quite remarkable how similar the structures of these two types of networks are, which emphasizes that the constraints from the chemical properties of the molecules has a larger influence in shaping the reaction system than does natural selection.

q-bio.MN↗
arXiv2010

Finite-size scaling in random $K$-satisfiability problems

We provide a comprehensive view of various phase transitions in random $K$-satisfiability problems solved by stochastic-local-search algorithms. In particular, we focus on the finite-size scaling (FSS) exponent, which is mathematically important and practically useful in analyzing finite systems. Using the FSS theory of nonequilibrium absorbing phase transitions, we show that the density of unsatisfied clauses clearly indicates the transition from the solvable (absorbing) phase to the unsolvable (active) phase as varying the noise parameter and the density of constraints. Based on the solution clustering (percolation-type) argument, we conjecture two possible values of the FSS exponent, which are confirmed reasonably well in numerical simulations for $2\le K \le 3$.

cond-mat.stat-mech↗
arXiv2010

Market behavior and performance of different strategy evaluation schemes

Strategy evaluation schemes are a crucial factor in any agent-based market model, as they determine the agents' strategy preferences and consequently their behavioral pattern. This study investigates how the strategy evaluation schemes adopted by agents affect their performance in conjunction with the market circumstances. We observe the performance of three strategy evaluation schemes, the history-dependent wealth game, the trend-opposing minority game, and the trend-following majority game, in a stock market where the price is exogenously determined. The price is either directly adopted from the real stock market indices or generated with a Markov chain of order $\le 2$. Each scheme's success is quantified by average wealth accumulated by the traders equipped with the scheme. The wealth game, as it learns from the history, shows relatively good performance unless the market is highly unpredictable. The majority game is successful in a trendy market dominated by long periods of sustained price increase or decrease. On the other hand, the minority game is suitable for a market with persistent zig-zag price patterns. We also discuss the consequence of implementing finite memory in the scoring processes of strategies. Our findings suggest under which market circumstances each evaluation scheme is appropriate for modeling the behavior of real market traders.

q-fin.PM↗
arXiv2010

Googling Social Interactions: Web Search Engine Based Social Network Construction

Social network analysis has long been an untiring topic of sociology. However, until the era of information technology, the availability of data, mainly collected by the traditional method of personal survey, was highly limited and prevented large-scale analysis. Recently, the exploding amount of automatically generated data has completely changed the pattern of research. For instance, the enormous amount of data from so-called high-throughput biological experiments has introduced a systematic or network viewpoint to traditional biology. Then, is "high-throughput" sociological data generation possible? Google, which has become one of the most influential symbols of the new Internet paradigm within the last ten years, might provide torrents of data sources for such study in this (now and forthcoming) digital era. We investigate social networks between people by extracting information on the Web and introduce new tools of analysis of such networks in the context of statistical physics of complex systems or socio-physics. As a concrete and illustrative example, the members of the 109th United States Senate are analyzed and it is demonstrated that the methods of construction and analysis are applicable to various other weighted networks.

physics.soc-ph↗
arXiv2010

A new approach to the 2-variable subnormal completion problem

We study the Subnormal Completion Problem (SCP) for 2-variable weighted shifts. We use tools and techniques from the theory of truncated moment problems to give a general strategy to solve SCP. We then show that when all quadratic moments are known (equivalently, when the initial segment of weights consists of five independent data points), the natural necessary conditions for the existence of a subnormal completion are also sufficient. To calculate explicitly the associated Berger measure, we compute the algebraic variety of the associated truncated moment problem; it turns out that this algebraic variety is precisely the support of the Berger measure of the subnormal completion.

math.FA↗
arXiv2009

Critical behavior of the Ising model in annealed scale-free networks

We study the critical behavior of the Ising model in annealed scale-free (SF) networks of finite system size with forced upper cutoff in degree. By mapping the model onto the weighted fully connected Ising model, we derive analytic results for the finite-size scaling (FSS) near the phase transition, characterized by the cutoff-dependent two-parameter scaling with four distinct scaling regimes, in highly heterogeneous networks. These results are essentially the same as those found for the nonequilibrium contact process in annealed SF networks, except for an additional complication due to the trivial critical point shift in finite systems. The discrepancy of the FSS theories between annealed and quenched SF networks still remains in the equilibrium Ising model, like some other nonequilibrium models. All of our analytic results are confirmed reasonably well by numerical simulations.

cond-mat.stat-mech↗
arXiv2009

Statistical properties of sampled networks

We study the statistical properties of the sampled scale-free networks, deeply related to the proper identification of various real-world networks. We exploit three methods of sampling and investigate the topological properties such as degree and betweenness centrality distribution, average path length, assortativity, and clustering coefficient of sampled networks compared with those of original networks. It is found that the quantities related to those properties in sampled networks appear to be estimated quite differently for each sampling method. We explain why such a biased estimation of quantities would emerge from the sampling procedure and give appropriate criteria for each sampling method to prevent the quantities from being overestimated or underestimated.

cond-mat.dis-nn↗
arXiv2007

Reconstruction of the Berger measure when the core is of tensor form

Let $\mathfrak{H}_{0}$ denote the class of commuting pairs of subnormal operators on Hilbert space, and let $\mathcal{TC}:=\{\mathbf{T}\in \mathfrak{% H}_{0}:c(\mathbf{T)}$ is of tensor form$\}$, where $c(\mathbf{T})$ is the core of $\mathbf{T}$. We obtain a concrete necessary and sufficient condition for the subnormality of $\mathbf{T}\equiv (T_{1},T_{2})\in \mathcal{TC}$ in terms of $c(\mathbf{T})$, the marginal measures of $T_{1}$ and $T_{2}$, and the weight $α_{01}$.

math.FA↗
arXiv2006

Hyponormality and subnormality for powers of commuting pairs of subnormal operators

Let H_0 (resp. H_\infty denote the class of commuting pairs of subnormal operators on Hilbert space (resp. subnormal pairs), and for an integer k>=1 let H_k denote the class of k-hyponormal pairs in H_0. We study the hyponormality and subnormality of powers of pairs in H_k. We first show that if (T_1,T_2) is in H_1, then the pair (T_1^2,T_2) may fail to be in H_1. Conversely, we find a pair (T_1,T_2) in H_0 such that (T_1^2,T_2) is in H_1 but (T_1,T_2) is not. Next, we show that there exists a pair (T_1,T_2) in H_1 such that T_1^mT_2^n is subnormal (all m,n >= 1), but (T_1,T_2) is not in H_\infty; this further stretches the gap between the classes H_1 and H_\infty. Finally, we prove that there exists a large class of 2-variable weighted shifts (T_1,T_2) (namely those pairs in H_0 whose cores are of tensor form) for which the subnormality of (T_1^2,T_2) and (T_1,T_2^2) does imply the subnormality of (T_1,T_2).

math.FA↗
arXiv2006

Random field Ising model on networks with inhomogeneous connections

We study a zero-temperature phase transition in the random field Ising model on scale-free networks with the degree exponent $γ$. Using an analytic mean-field theory, we find that the spins are always in the ordered phase for $γ<3$. On the other hand, the spins undergo a phase transition from an ordered phase to a disordered phase as the dispersion of the random fields increases for $γ> 3$. The phase transition may be either continuous or discontinuous depending on the shape of the random field distribution. We derive the condition for the nature of the phase transition. Numerical simulations are performed to confirm the results.

cond-mat.stat-mech↗
arXiv2006

Effects of substrate network topologies on competition dynamics

We study a competition dynamics, based on the minority game, endowed with various substrate network structures. We observe the effects of the network topologies by investigating the volatility of the system and the structure of follower networks. The topology of substrate structures significantly influences the system efficiency represented by the volatility and such substrate networks are shown to amplify the herding effect and cause inefficiency in most cases. The follower networks emerging from the leadership structure show a power-law incoming degree distribution. This study shows the emergence of scale-free structures of leadership in the minority game and the effects of the interaction among players on the networked version of the game.

cond-mat.dis-nn↗
arXiv2005

k-hyponormality of multivariable weighted shifts

We characterize joint k-hyponormality for 2-variable weighted shifts. Using this characterization we construct a family of examples which establishes and illustrates the gap between k-hyponormality and (k+1)-hyponormality for each k>=1. As a consequence, we obtain an abstract solution to the Lifting Problem for Commuting Subnormals.

math.FA↗