Searcharxiv⌕ Search

arXiv subjects

Byungjoon Min

Publications and source records attributed to Byungjoon Min.

At least 37 records · Page 2Linked to original sources

Message-passing theory for cooperative epidemics

The interaction among spreading processes on a complex network is a nontrivial phenomenon of great importance. It has recently been realized that cooperative effects among infective diseases can give rise to qualitative changes in the phenomenology of epidemic spreading, leading for instance to abrupt transitions and hysteresis. Here we consider a simple model for two interacting pathogens on a network and we study it by using the message-passing approach. In this way we are able to provide detailed predictions for the behavior of the model in the whole phase-diagram for any given network structure. Numerical simulations on synthetic networks (both homogeneous and heterogeneous) confirm the great accuracy of the theoretical results. We finally consider the issue of identifying the nodes where it is better to seed the infection in order to maximize the probability of observing an extensive outbreak. The message-passing approach provides an accurate solution also for this problem.

physics.soc-ph↗

Competition and dual users in complex contagion processes

We study the competition of two spreading entities, for example innovations, in complex contagion processes in complex networks. We develop an analytical framework and examine the role of dual users, i.e. agents using both technologies. Searching for the spreading transition of the new innovation and the extinction transition of a preexisting one, we identify different phases depending on network mean degree, prevalence of preexisting technology, and thresholds of the contagion process. Competition with the preexisting technology effectively suppresses the spread of the new innovation, but it also allows for phases of coexistence. The existence of dual users largely modifies the transient dynamics creating new phases that promote the spread of a new innovation and extinction of a preexisting one. It enables the global spread of the new innovation even if the old one has the first-mover advantage.

physics.soc-ph↗

Multilayer coevolution dynamics of the nonlinear voter model

We study a coevolving nonlinear voter model on a two-layer network. Coevolution stands for coupled dynamics of the state of the nodes and of the topology of the network in each layer. The plasticity parameter p measures the relative time scale of the evolution of the states of the nodes and the evolution of the network by link rewiring. Nonlinearity of the interactions is taken into account through a parameter q that describes the nonlinear effect of local majorities, being q = 1 the marginal situation of the ordinary voter model. Finally the connection between the two layers is measured by a degree of multiplexing `. In terms of these three parameters, p, q and ` we find a rich phase diagram with different phases and transitions. When the two layers have the same plasticity p, the fragmentation transition observed in a single layer is shifted to larger values of p plasticity, so that multiplexing avoids fragmentation. Different plasticities for the two layers lead to new phases that do not exist in a coevolving nonlinear voter model in a single layer, namely an asymmetric fragmented phase for q > 1 and an active shattered phase for q < 1. Coupling layers with dfferent types of nonlinearity, q1 < 1 and q2 > 1, we can find two different transitions by increasing the plasticity parameter, a first absorbing transition with no fragmentation and a subsequent fragmentation transition.

nlin.AO↗

Competing contagion processes: Complex contagion triggered by simple contagion

Empirical evidence reveals that contagion processes often occur with competition of simple and complex contagion, meaning that while some agents follow simple contagion, others follow complex contagion. Simple contagion refers to spreading processes induced by a single exposure to a contagious entity while complex contagion demands multiple exposures for transmission. Inspired by this observation, we propose a model of contagion dynamics with a transmission probability that initiates a process of complex contagion. With this probability nodes subject to simple contagion get adopted and trigger a process of complex contagion. We obtain a phase diagram in the parameter space of the transmission probability and the fraction of nodes subject to complex contagion. Our contagion model exhibits a rich variety of phase transitions such as continuous, discontinuous, and hybrid phase transitions, criticality, tricriticality, and double transitions. In particular, we find a double phase transition showing a continuous transition and a following discontinuous transition in the density of adopted nodes with respect to the transmission probability. We show that the double transition occurs with an intermediate phase in which nodes following simple contagion become adopted but nodes with complex contagion remain susceptible.

cond-mat.stat-mech↗

Coevolving nonlinear voter model with triadic closure

We study a nonlinear coevolving voter model with triadic closure local rewiring. We find three phases with different topological properties and configuration in the steady state: absorbing consensus phase with a single component, absorbing fragmented phase with two components in opposite consensus states, and a dynamically active shattered phase with many isolated nodes. This shattered phase, which does not exist for a coevolving model with global rewiring, has a lifetime that scale exponentially with system size. We characterize the transitions between these phases in terms of the size of the largest cluster, the number of clusters, and the magnetization. Our analysis provides a possible solution to reproduce isolated parts in adaptive networks and high clustering widely observed in social systems.

physics.soc-ph↗

Finding influential nodes for integration in brain networks using optimal percolation theory

Global integration of information in the brain results from complex interactions of segregated brain networks. Identifying the most influential neuronal populations that efficiently bind these networks is a fundamental problem of systems neuroscience. Here we apply optimal percolation theory and pharmacogenetic interventions in-vivo to predict and subsequently target nodes that are essential for global integration of a memory network in rodents. The theory predicts that integration in the memory network is mediated by a set of low-degree nodes located in the nucleus accumbens. This result is confirmed with pharmacogenetic inactivation of the nucleus accumbens, which eliminates the formation of the memory network, while inactivations of other brain areas leave the network intact. Thus, optimal percolation theory predicts essential nodes in brain networks. This could be used to identify targets of interventions to modulate brain function.

q-bio.NC↗

Correlated network of networks enhances robustness against catastrophic failures

Networks in nature rarely function in isolation but instead interact with one another with a form of a network of networks (NoN). A network of networks with interdependency between distinct networks contains instability of abrupt collapse related to the global rule of activation. As a remedy of the collapse instability, here we investigate a model of correlated NoN. We find that the collapse instability can be removed when hubs provide the majority of interconnections and interconnections are convergent between hubs. Thus, our study identifies a stable structure of correlated NoN against catastrophic failures. Our result further suggests a plausible way to enhance network robustness by manipulating connection patterns, along with other methods such as controlling the state of node based on a local rule.

physics.soc-ph↗

Identifying an influential spreader from a single seed in complex networks via a message-passing approach

Identifying the most influential spreaders is one of outstanding problems in physics of complex systems. So far, many approaches have attempted to rank the influence of nodes but there is still the lack of accuracy to single out influential spreaders. Here, we directly tackle the problem of finding important spreaders by solving analytically the expected size of epidemic outbreaks when spreading originates from a single seed. We derive and validate a theory for calculating the size of epidemic outbreaks with a single seed using a message-passing approach. In addition, we find that the probability to occur epidemic outbreaks is highly dependent on the location of the seed but the size of epidemic outbreaks once it occurs is insensitive to the seed. We also show that our approach can be successfully adapted into weighted networks.

physics.soc-ph↗

Fragmentation transitions in a coevolving nonlinear voter model

We study a coevolving nonlinear voter model describing the coupled evolution of the states of the nodes and the network topology. Nonlinearity of the interaction is measured by a parameter q. The network topology changes by rewiring links at a rate p. By analytical and numerical analysis we obtain a phase diagram in p, q parameter space with three different phases: Dynamically active coexistence phase in a single component network, absorbing consensus phase in a single component network, and absorbing phase in a fragmented network. For finite systems the active phase has a lifetime that grows exponentially with system size, at variance with the similar phase for the linear voter model that has a lifetime proportional to system size. We find three transition lines that meet at the point of the fragmentation transition of the linear voter model. A first transition line corresponds to a continuous absorbing transition between the active and fragmented phases. The other two transition lines are discontinuous transitions fundamentally different from the transition of the linear voter model. One is a fragmentation transition between the consensus and fragmented phases, and the other is an absorbing transition in a single component network between the active and consensus phases.

physics.soc-ph↗

Synchronized and mixed outbreaks of coupled recurrent epidemics

Epidemic spreading has been studied for a long time and most of them are focused on the growing aspect of a single epidemic outbreak. Recently, we extended the study to the case of recurrent epidemics (Sci. Rep. {\bf 5}, 16010 (2015)) but limited only to a single network. We here report from the real data of coupled regions or cities that the recurrent epidemics in two coupled networks are closely related to each other and can show either synchronized outbreak phase where outbreaks occur simultaneously in both networks or mixed outbreak phase where outbreaks occur in one network but do not in another one. To reveal the underlying mechanism, we present a two-layered network model of coupled recurrent epidemics to reproduce the synchronized and mixed outbreak phases. We show that the synchronized outbreak phase is preferred to be triggered in two coupled networks with the same average degree while the mixed outbreak phase is preferred for the case with different average degrees. Further, we show that the coupling between the two layers is preferred to suppress the mixed outbreak phase but enhance the synchronized outbreak phase. A theoretical analysis based on microscopic Markov-chain approach is presented to explain the numerical results. This finding opens a new window for studying the recurrent epidemics in multi-layered networks.

physics.soc-ph↗

Model of Brain Activation Predicts the Neural Collective Influence Map of the Brain

Efficient complex systems have a modular structure, but modularity does not guarantee robustness, because efficiency also requires an ingenious interplay of the interacting modular components. The human brain is the elemental paradigm of an efficient robust modular system interconnected as a network of networks (NoN). Understanding the emergence of robustness in such modular architectures from the interconnections of its parts is a long-standing challenge that has concerned many scientists. Current models of dependencies in NoN inspired by the power grid express interactions among modules with fragile couplings that amplify even small shocks, thus preventing functionality. Therefore, we introduce a model of NoN to shape the pattern of brain activations to form a modular environment that is robust. The model predicts the map of neural collective influencers (NCIs) in the brain, through the optimization of the influence of the minimal set of essential nodes responsible for broadcasting information to the whole-brain NoN. Our results suggest new intervention protocols to control brain activity by targeting influential neural nodes predicted by network theory.

q-bio.NC↗

Emergence of Robustness in Network of Networks

A model of interdependent networks of networks (NoN) has been introduced recently in the context of brain activation to identify the neural collective influencers in the brain NoN. Here we develop a new approach to derive an exact expression for the random percolation transition in Erdös-Rényi NoN. Analytical calculations are in excellent agreement with numerical simulations and highlight the robustness of the NoN against random node failures. Interestingly, the phase diagram of the model unveils particular patterns of interconnectivity for which the NoN is most vulnerable. Our results help to understand the emergence of robustness in such interdependent architectures.

q-bio.NC↗

Collective Influence Algorithm to find influencers via optimal percolation in massively large social media

We elaborate on a linear time implementation of the Collective Influence (CI) algorithm introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in a network via optimal percolation. We show that the computational complexity of CI is O(N log N) when removing nodes one-by-one, with N the number of nodes. This is made possible by using an appropriate data structure to process the CI values, and by the finite radius l of the CI sphere. Furthermore, we introduce a simple extension of CI when l is infinite, the CI propagation (CI_P) algorithm, that considers the global optimization of influence via message passing in the whole network and identifies a slightly smaller fraction of influencers than CI. Remarkably, CI_P is able to reproduce the exact analytical optimal percolation threshold obtained by Bau, Wormald, Random Struct. Alg. 21, 397 (2002) for cubic random regular graphs, leaving little improvement left for random graphs. We also introduce the Collective Immunization Belief Propagation algorithm (CI_BP), a belief-propagation (BP) variant of CI based on optimal immunization, which has the same performance as CI_P. However, this small augmented performance of the order of 1-2 % in the low influencers tail comes at the expense of increasing the computational complexity from O(N log N) to O(N^2 log N), rendering both, CI_P and CI_BP, prohibitive for finding influencers in modern-day big-data. The same nonlinear running time drawback pertains to a recently introduced BP-decimation (BPD) algorithm by Mugisha, Zhou, arXiv:1603.05781. For instance, we show that for big-data social networks of typically 200 million users (eg, active Twitter users sending 500 million tweets per day), CI finds the influencers in less than 3 hours running on a single CPU, while the BP algorithms (CI_P, CI_BP and BDP) would take more than 3,000 years to accomplish the same task.

physics.soc-ph↗

Layer-switching cost and optimality in information spreading on multiplex networks

We study a model of information spreading on multiplex networks, in which agents interact through multiple interaction channels (layers), say online vs.\ offline communication layers, subject to layer-switching cost for transmissions across different interaction layers. The model is characterized by the layer-wise path-dependent transmissibility over a contact, that is dynamically determined dependently on both incoming and outgoing transmission layers. We formulate an analytical framework to deal with such path-dependent transmissibility and demonstrate the nontrivial interplay between the multiplexity and spreading dynamics, including optimality. It is shown that the epidemic threshold and prevalence respond to the layer-switching cost non-monotonically and that the optimal conditions can change in abrupt non-analytic ways, depending also on the densities of network layers and the type of seed infections. Our results elucidate the essential role of multiplexity that its explicit consideration should be crucial for realistic modeling and prediction of spreading phenomena on multiplex social networks in an era of ever-diversifying social interaction layers.

physics.soc-ph↗

Finding influential spreaders from human activity beyond network location

Most centralities proposed for identifying influential spreaders on social networks to either spread a message or to stop an epidemic require the full topological information of the network on which spreading occurs. In practice, however, collecting all connections between agents in social networks can be hardly achieved. As a result, such metrics could be difficult to apply to real social networks. Consequently, a new approach for identifying influential people without the explicit network information is demanded in order to provide an efficient immunization or spreading strategy, in a practical sense. In this study, we seek a possible way for finding influential spreaders by using the social mechanisms of how social connections are formed in real networks. We find that a reliable immunization scheme can be achieved by asking people how they interact with each other. From these surveys we find that the probabilistic tendency to connect to a hub has the strongest predictive power for influential spreaders among tested social mechanisms. Our observation also suggests that people who connect different communities is more likely to be an influential spreader when a network has a strong modular structure. Our finding implies that not only the effect of network location but also the behavior of individuals is important to design optimal immunization or spreading schemes.

physics.soc-ph↗

Towards real-world complexity: an introduction to multiplex networks

Many real-world complex systems are best modeled by multiplex networks of interacting network layers. The multiplex network study is one of the newest and hottest themes in the statistical physics of complex networks. Pioneering studies have proven that the multiplexity has broad impact on the system's structure and function. In this Colloquium paper, we present an organized review of the growing body of current literature on multiplex networks by categorizing existing studies broadly according to the type of layer coupling in the problem. Major recent advances in the field are surveyed and some outstanding open challenges and future perspectives will be proposed.

physics.soc-ph↗

Link overlap, viability, and mutual percolation in multiplex networks

Many real-world complex systems are best modeled by multiplex networks. The multiplexity has proved to have broad impact on the system's structure and function. Most theoretical studies on multiplex networks to date, however, have largely ignored the effect of link overlap across layers despite strong empirical evidences for its significance. In this article, we investigate the effect of link overlap in the viability of multiplex networks, both analytically and numerically. Distinctive role of overlapping links in viability and mutual connectivity is emphasized and exploited for setting up proper analytic framework. A rich phase diagram for viability is obtained and greatly diversified patterns of hysteretic behavior in viability are observed in the presence of link overlap. Mutual percolation with link overlap is revisited as a limit of multiplex viability problem, and controversy between existing results is clarified. The distinctive role of overlapping links is further demonstrated by the different responses of networks under random removals of overlapping and non-overlapping links, respectively, as well as under several removal strategies. Our results show that the link overlap strongly facilitates viability and mutual percolation; at the same time, the presence of link overlap poses challenge in analytical approach to the problem.

physics.soc-ph↗

Multiple resource demands and viability in multiplex networks

Many complex systems demand manifold resources to be supplied from distinct channels to function properly, i.e, water, gas, and electricity for a city. Here, we study a model for viability of such systems demanding more than one type of vital resources produced and distributed by resource nodes in multiplex networks. We found a rich variety of behaviors such as discontinuity, bistability, and hysteresis in the fraction of viable nodes with respect to the density of networks and the fraction of resource nodes. Our result suggests that viability in multiplex networks is not only exposed to the risk of abrupt collapse but also suffers excessive complication in recovery.

physics.soc-ph↗