Seung Woo Son - Univ. of Illinois at Urbana-Champaign

Seung Woo Son
Are you Seung Woo Son?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Seung Woo Son
Affiliation
Univ. of Illinois at Urbana-Champaign
City
Champaign
Country
United States

Pubs By Year

Pub Categories

 
Physics - Physics and Society (10)
 
Physics - Disordered Systems and Neural Networks (9)
 
Physics - Statistical Mechanics (9)
 
Physics - Data Analysis; Statistics and Probability (8)
 
High Energy Physics - Theory (2)
 
Computer Science - Computer Science and Game Theory (1)
 
Computer Science - Distributed; Parallel; and Cluster Computing (1)

Publications Authored By Seung Woo Son

Many scientific data sets contain temporal dimensions. These are the data storing information at the same spatial location but different time stamps. Some of the biggest temporal datasets are produced by parallel computing applications such as simulations of climate change and fluid dynamics. Read More

We consider a tournament among four equally strong semifinalists. The players have to decide how much stamina to use in the semifinals, provided that the rest is available in the final and the third-place playoff. We investigate optimal strategies for allocating stamina to the successive matches when players' prizes (payoffs) are given according to the tournament results. Read More

We investigate the win-lose relations between strategies of iterated prisoner's dilemma games by using a directed network concept to display the replicator dynamics results. In the giant strongly-connected component of the win/lose network, we find win-lose circulations similar to rock-paper-scissors and analyze the fixed point and its stability. Applying the network motif concept, we introduce dynamic motifs, which describe the population dynamics relations among the three strategies. Read More

After the Achlioptas process (AP), which yields the so-called explosive percolation, was introduced, the number of papers on percolation phenomena has been literally exploding. Most of the existing studies, however, have focused only on the nature of phase transitions, not paying proper attention to the structural properties of the resulting networks, which compose the main theme of the present paper. We compare the resulting network structure of the AP with random networks and find, through observations of the distributions of the shortest-path length and the betweenness centrality in the giant cluster, that the AP makes the network less clustered and more fragile. Read More

The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a zero-one-only process. It makes a step in the same direction as the previous step with probability $p$, and stops to change the direction with $1-p$. Read More

We use replicator dynamics to study an iterated prisoners' dilemma game with memory. In this study, we investigate the characteristics of all 32 possible strategies with a single-step memory by observing the results when each strategy encounters another one. Based on these results, we define similarity measures between the 32 strategies and perform a network analysis of the relationship between the strategies by constructing a strategies network. Read More

We consider a costly bilingualism model in which one can take two strategies in parallel. We investigate how a single zealot triggers the cascading behavior and how the compatibility of the two strategies affects when interacting patterns change. First, the role of the interaction range on the cascading is studied by increasing the range from local to global. Read More

We study the percolation transition in growing networks under an Achlioptas process (AP). At each time step, a node is added in the network and, with the probability $\delta$, a link is formed between two nodes chosen by an AP. We find that there occurs the percolation transition with varying $\delta$ and the critical point $\delta_c=0. Read More

PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank-stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank-reversal happens frequently over a broad range of PR (and of d). Read More

For many real-world networks only a small "sampled" version of the original network may be investigated; those results are then used to draw conclusions about the actual system. Variants of breadth-first search (BFS) sampling, which are based on epidemic processes, are widely used. Although it is well established that BFS sampling fails, in most cases, to capture the IN-component(s) of directed networks, a description of the effects of BFS sampling on other topological properties are all but absent from the literature. Read More

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. Read More

We consider percolation on interdependent locally treelike networks, recently introduced by Buldyrev et al., Nature 464, 1025 (2010), and demonstrate that the problem can be simplified conceptually by deleting all references to cascades of failures. Such cascades do exist, but their explicit treatment just complicates the theory -- which is a straightforward extension of the usual epidemic spreading theory on a single network. Read More

We consider the mass-dependent aggregation process (k+1)X -> X, given a fixed number of unit mass particles in the initial state. One cluster is chosen proportional to its mass and is merged into one either with k-neighbors in one dimension, or -- in the well-mixed case -- with k other clusters picked randomly. We find the same combinatorial exact solutions for the probability to find any given configuration of particles on a ring or line, and in the well-mixed case. Read More

We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a percolation transition that has been claimed to be more abrupt than that for uncoupled networks. Read More

We study four Achlioptas type processes with "explosive" percolation transitions. All transitions are clearly continuous, but their finite size scaling functions are not entire holomorphic. The distributions of the order parameter, the relative size $s_{\rm max}/N$ of the largest cluster, are double-humped. Read More

We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging length scale near a critical point. Read More

We proposed a method called residual edge-betweenness gradient (REBG) to enhance synchronizability of networks by assignment of link direction while keeping network topology and link weight unchanged. Direction assignment has been shown to improve the synchronizability of undirected networks in general, but we find that in some cases incommunicable components emerge and networks fail to synchronize. We show that the REBG method can effectively avoid the synchronization failure ($R=\lambda_{2}^{r}/\lambda_{N}^{r}=0$) which occurs in the residual degree gradient (RDG) method proposed in Phys. Read More

Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the complete solution for the probability to find any given state in an aggregation process $(k+1)X\to X$, given a fixed number of unit mass particles in the initial state. Read More

To identify communities in directed networks, we propose a generalized form of modularity in directed networks by introducing a new quantity LinkRank, which can be considered as the PageRank of links. This generalization is consistent with the original modularity in undirected networks and the modularity optimization methods developed for undirected networks can be directly applied to directed networks by optimizing our new modularity. Also, a model network, which can be used as a benchmark network in further community studies, is proposed to verify our method. Read More

As a first step to understand anomalous kinetic roughening with multifractality in recent experiments of the vapor deposition polymerization (VDP) growth, we study a simple toy model of the VDP growth in a (1+1)-dimensional lattice, along with monomer diffusion, polymer nucleation, limited active end bonding, and shadowing effects. Using extensive numerical simulations, we observe that the global roughness exponent is different from the local one. It is argued that such anomalies in VDP growth are attributed to the instability induced by the nonlocal shadowing effects on active ends of polymers. Read More

We propose a method to find out the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field $B_s = +\infty$, $B_{t} = -\infty$, and $B_{i\neq s,t}=0$ for a node pair $s$ and $t$. The ground state problem is equivalent to the so-called maximum flow problem, which can be solved exactly numerically with the help of a combinatorial optimization algorithm. Read More

1995Jul
Authors: Seung Hwan Son1
Affiliations: 1Univ. of Illinois at Urbana-Champaign

This article presents a formula for some dispersionless equations and a brief review of the operators which have been used for the dispersionless KP hierarchy. Read More

1995Jun
Authors: Seung Hwan Son1
Affiliations: 1University of Illinois at Urbana-Champaign

This short article presents a table of new equations which can be regarded as the generalized equations of the dispersionless limit of several nonlinear equations. From the definition expressed in an algebraic formula, one can get an equation for any positive numbers p and q. The equations were calculated by using the computers and were examined by hand-calculation up to p=10. Read More