arXiv subjects

Seung-Woo Son

Publications and source records attributed to Seung-Woo Son.

At least 37 records · Page 2Linked to original sources

arXiv2020

Motif Dynamics in Signed Directional Complex Networks

Complex networks evolve and vary their structure as time goes by. In particular, the links in those networks have both a sign and a directionality. To understand their structural principles, we measure the network motifs, which are patterns that appear much more than one would expect in randomized networks, considering both link properties. We propose motif dynamics, which is a study to investigate the change in the number of motifs, and applied the motif dynamics to an open evolving network model and empirical data. We confirm that a non-cyclic motif has a greater correlation with the system size than a cyclic structural motif. Furthermore, the motif dynamics can give us insight into the friendship between freshmen in a university.

physics.soc-ph↗

arXiv2020

Criticality in spreading processes without time-scale separation and the critical brain hypothesis

Spreading processes on networks are ubiquitous in both human-made and natural systems. Understanding their behavior is of broad interest; from the control of epidemics to understanding brain dynamics. While in some cases there exists a clear separation of time scales between the propagation of a single spreading cascade and the initiation of the next -- such that spreading can be modelled as directed percolation or a branching process -- there are also processes for which this is not the case, such as zoonotic diseases or spiking cascades in neural networks. For a large class of relevant network topologies, we show here that in such a scenario the nature of the overall spreading fundamentally changes. This change manifests itself in a transition between different universality classes of critical spreading, which determines the onset and the properties of an avalanche turning epidemic or neural activity turning epileptic, for example. We present analytical results in the mean-field limit giving the critical line along which scale-free spreading behaviour can be observed. The two limits of this critical line correspond to the universality classes of directed and undirected percolation, respectively. Outside these two limits, this duality manifests itself in the appearance of critical exponents from the universality classes of both directed and undirected percolation. We find that the transition between these exponents is governed by a competition between merging and propagation of activity, and identify an appropriate scaling relationship for the transition point. Finally, we show that commonly used measures, such as the branching ratio and dynamic susceptibility, fail to establish criticality in the absence of time-scale separation calling for a reanalysis of criticality in the brain.

cond-mat.stat-mech↗

arXiv2020

Synchronization of active rotators interacting with environment

Multiple organs in a living system respond to environmental changes, and the signals from the organs regulate the physiological environment. Inspired by this biological feedback, we propose a simple autonomous system of active rotators to explain how multiple units are synchronized under a fluctuating environment. We find that the feedback via an environment can entrain rotators to have synchronous phases for specific conditions. This mechanism is markedly different from the simple entrainment by a common oscillatory external stimulus that is not interacting with systems. We theoretically examine how the phase synchronization depends on the interaction strength between rotators and environment. Furthermore, we successfully demonstrate the proposed model by realizing an analog electric circuit with microelectronic devices. This bio-inspired platform can be used as a sensor for monitoring varying environments, and as a controller for amplifying signals by their feedback-induced synchronization.

cond-mat.stat-mech↗

arXiv2019

On structural and dynamical factors determining the integrated basin instability of power-grid nodes

In electric power systems delivering alternating current, it is essential to maintain its synchrony of the phase with the rated frequency. The synchronization stability that quantifies how well the power-grid system recovers its synchrony against perturbation depends on various factors. As an intrinsic factor that we can design and control, the transmission capacity of the power grid affects the synchronization stability. Therefore, the transition pattern of the synchronization stability with the different levels of transmission capacity against external perturbation provides the stereoscopic perspective to understand the synchronization behavior of power grids. In this study, we extensively investigate the factors affecting the synchronization stability transition by using the concept of basin stability as a function of the transmission capacity. For a systematic approach, we introduce the integrated basin instability, which literally adds up the instability values as the transmission capacity increases. We first take simple 5-node motifs as a case study of building blocks of power grids, and a more realistic IEEE 24-bus model to highlight the complexity of decisive factors. We find that both structural properties such as gate keepers in network topology and dynamical properties such as large power input/output at nodes cause synchronization instability. The results suggest that evenly distributed power generation and avoidance of bottlenecks can improve the overall synchronization stability of power-grid systems.

physics.soc-ph↗

arXiv2018

Multistability and Variations in Basin of Attraction in Power-grid Systems

Power grids sustain modern society by supplying electricity and thus their stability is a crucial factor for our civilization. The dynamic stability of a power grid is usually quantified by the probability of its nodes' recovery to phase synchronization of the alternating current it carries, in response to external perturbation. Intuitively, the stability of nodes in power grids is supposed to become more robust as the coupling strength between the nodes increases. However, we find a counterintuitive range of coupling strength values where the synchronization stability suddenly droops as the coupling strength increases, on a number of simple graph structures. Since power grids are designed to fulfill both local and long-range power demands, such simple graph structures or graphlets for local power transmission are indeed relevant in reality. We show that the observed nonmonotonic behavior is a consequence of transitions in multistability, which are related to changes in stability of the \emph{unsynchronized} states. Therefore, our findings suggest that a comprehensive understanding of changes in multistability are necessary to prevent the unexpected catastrophic instability in the building blocks of power grids.

nlin.CD↗

arXiv2015

Nash equilibrium and evolutionary dynamics in semifinalists' dilemma

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. From the basic assumption that the probability to win a match follows a nondecreasing function of stamina difference, we present symmetric Nash equilibria for general payoff structures. We find three different phases of the Nash equilibria in the payoff space. First, when the champion wins a much bigger payoff than the others, any pure strategy can constitute a Nash equilibrium as long as all four players adopt it in common. Second, when the first two places are much more valuable than the other two, the only Nash equilibrium is such that everyone uses a pure strategy investing all stamina in the semifinal. Third, when the payoff for last place is much smaller than the others, a Nash equilibrium is formed when every player adopts a mixed strategy of using all or none of its stamina in the semifinals. In a limiting case that only last place pays the penalty, this mixed-strategy profile can be proved to be a unique symmetric Nash equilibrium, at least when the winning probability follows a Heaviside step function. Moreover, by using this Heaviside step function, we study the tournament by using evolutionary replicator dynamics to obtain analytic solutions, which reproduces the corresponding Nash equilibria on the population level and gives information on dynamic aspects.

physics.soc-ph↗

arXiv2015

Dynamic Motifs of Strategies in Prisoner's Dilemma Games

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. Through exact enumeration, we find 22 dynamic motifs and display their phase portraits. Visualization using directed networks and motif analysis is a useful method to make complex dynamic behavior simple in order to understand it more intuitively. Dynamic motifs can be building blocks for dynamic behavior among strategies when they are applied to other types of games.

physics.soc-ph↗

arXiv2014

Structural Properties of Networks Grown via an Achlioptas Process

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. Such structural characteristics are more directly seen by using snapshots of the network structures and are explained by the fact that the AP suppresses the formation of large clusters more strongly than the random process does. These structural differences between the two processes are shown to be less noticeable in growing networks than in static ones.

cond-mat.dis-nn↗

arXiv2014

Zero-one-only process: a correlated random walk with a stochastic ratchet

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$. By using the generating-function method, we calculate its characteristic quantities such as the statistical moments and probability of the first return.

physics.data-an↗

arXiv2014

Network Structures between Strategies in Iterated Prisoners' Dilemma Games

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. Interestingly, we find that a win-lose circulation, like rock-paper-scissors, exists between strategies and that the circulation results from one unusual strategy.

physics.soc-ph↗

arXiv2013

Costly bilingualism model in a population with one zealot

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. We find that people sometimes do not favor to take the superior strategy even though its payoff is higher than that of the inferior one. This is found to be caused by the local interactions rather than the global ones. Applying this model to social networks, we find that the location of the zealot is also important for larger cascading in heterogeneous networks.

physics.soc-ph↗

arXiv2013

Percolation properties of growing networks under an Achlioptas process

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 $δ$, a link is formed between two nodes chosen by an AP. We find that there occurs the percolation transition with varying $δ$ and the critical point $δ_c=0.5149(1)$ is determined from the power-law behavior of order parameter and the crossing of the fourth-order cumulant at the critical point, also confirmed by the movement of the peak positions of the second largest cluster size to the $δ_c$. Using the finite-size scaling analysis, we get $β/\barν=0.20(1)$ and $1/\barν=0.40(1)$, which implies $β\approx 1/2$ and $\barν \approx 5/2$. The Fisher exponent $τ= 2.24(1)$ for the cluster size distribution is obtained and shown to satisfy the hyperscaling relation.

cond-mat.stat-mech↗

arXiv2012

Sampling properties of directed networks

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. To systematically study the effects of sampling biases on directed networks, we compare BFS sampling to random sampling on complete large-scale directed networks. We present new results and a thorough analysis of the topological properties of seven different complete directed networks (prior to sampling), including three versions of Wikipedia, three different sources of sampled World Wide Web data, and an Internet-based social network. We detail the differences that sampling method and coverage can make to the structural properties of sampled versions of these seven networks. Most notably, we find that sampling method and coverage affect both the bow-tie structure, as well as the number and structure of strongly connected components in sampled networks. In addition, at low sampling coverage (i.e. less than 40%), the values of average degree, variance of out-degree, degree auto-correlation, and link reciprocity are overestimated by 30% or more in BFS-sampled networks, and only attain values within 10% of the corresponding values in the complete networks when sampling coverage is in excess of 65%. These results may cause us to rethink what we know about the structure, function, and evolution of real-world directed networks.

physics.soc-ph↗

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↗

arXiv2012

PageRank and rank-reversal dependence on the damping factor

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). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank-reversal as d changes, and show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, $d_0=0.85$. Rank-reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank-reversal happens not only in directed networks containing rank-sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank-reversals to rank-pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around $d=0.65$ than at $d=d_0$.

physics.soc-ph↗

arXiv2011

Agglomerative Percolation in Two Dimensions

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. Picking target clusters with probability proportional to their mass leads to a runaway compact cluster. Choosing all clusters equally leads to a continuous transition in a new universality class for the square lattice, while the transition on the triangular lattice has the same critical exponents as ordinary percolation.

cond-mat.stat-mech↗

arXiv2011

Percolation Theory on Interdependent Networks Based on Epidemic Spreading

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. Our method has the added benefits that it is directly formulated in terms of an order parameter and its modular structure can be easily extended to other problems, e.g. to any number of interdependent networks, or to networks with dependency links.

physics.data-an↗

arXiv2011

Are Percolation Transitions always Sharpened by Making Networks Interdependent?

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. Indeed, it was found to be discontinuous in all cases studied. Using an efficient new algorithm we verify that the transition is discontinuous for coupled Erdos-Renyi networks, but find it to be continuous for fully interdependent diluted lattices. In 2 and 3 dimension, the order parameter exponent $β$ is larger than in ordinary percolation, showing that the transition is less sharp, i.e. further from discontinuity, than for isolated networks. Possible consequences for spatially embedded networks are discussed.

physics.data-an↗