Searcharxiv⌕ Search

arXiv subjects

B. Kahng

Publications and source records attributed to B. Kahng.

At least 55 records · Page 3Linked to original sources

Nonequilibrium phase transition in an open quantum spin system with long-range interaction

We investigate a nonequilibrium phase transition in a dissipative and coherent quantum spin system using the quantum Langevin equation and mean-field theory. Recently, the quantum contact process (QCP) was theoretically investigated using the Rydberg antiblockade effect, in particular, when the Rydberg atoms were excited in s-states so that their interactions were regarded as being between the nearest neighbors. However, when the atoms are excited to d-states, the dipole-dipole interactions become effective, and long-range interactions must be considered. Here, we consider a quantum spin model with a long-range QCP, where the branching and coagulation processes are allowed not only for the nearest-neighbor pairs, but also for long-distance pairs, coherently and incoherently. Using the semiclassical approach, we show that the mean-field phase diagram of our long-range model is similar to that of the nearest-neighbor QCP, where the continuous (discontinuous) transition is found in the weak (strong) quantum regime. However, at the tricritical point, we find a new universality class, which was neither that of the QCP at the tricritical point nor that of the classical directed percolation model with long-range interactions. Implementation of the long-range QCP using interacting cold gases is discussed.

cond-mat.stat-mech↗

Essentiality landscape of metabolic networks

Local perturbations of individual metabolic reactions may result in different levels of lethality, depending on their roles in metabolism and the size of subsequent cascades induced by their failure. Moreover, essentiality of individual metabolic reactions may show large variations within and across species. Here we quantify their essentialities in hundreds of species by computing the growth rate after removal of individual and pairs of reactions by flux balance analysis. We find that about 10% of reactions are essential, i.e., growth stops without them, and most of the remaining reactions are redundant in the metabolic network of each species. This large-scale and cross-species study allows us to determine ad hoc ages of each reaction and species. We find that when a reaction is older and contained in younger species, the reaction is more likely to be essential. Such correlations of essentiality with the ages of reactions and species may be attributable to the evolution of cellular metabolism, in which alternative pathways are recruited to ensure the stability of important reactions to various degrees across species.

q-bio.MN↗

Anomalous percolation transitions beyond the BKT transition in growing networks

Since the discovery a half century ago that 1/r^2-type long-range interactions in the one-dimensional Ising model change the phase transition type, long-range interactions in diverse systems have received considerable attention. Recently, this interest extended to global suppression dynamics in the percolation transition, which changes a second-order transition to first order. Here, we investigate how the Berezinskii-Kosterlitz-Thouless (BKT) transition is changed by the global suppression effect. In fact, this effect often arises in real-world complex systems, yet it is not appropriately accounted for in models. We find that the BKT transition breaks down, but the features of infinite-, second-, and first-order transitions all emerge as the link occupation probability is controlled. Moreover, we find that such growing networks exhibit maximum diversity, causing the mean cluster size to diverge without formation of a giant cluster. We elucidate the underlying mechanisms and show that such anomalous transitions are universal.

cond-mat.stat-mech↗

Recent advances of percolation theory in complex networks

During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous transitions, the percolation transitions occurring in complex systems are often of different types such as discontinuous, hybrid, and infinite-order phase transitions. Thus, percolation has received considerable attention in network science community. Here we present a very brief review of percolation theory recently developed, which includes those types of phase transitions, critical phenomena, and finite-size scaling theory. Moreover, we discuss potential applications of theoretical results and several open questions including universal behaviors.

physics.soc-ph↗

Dismantling Efficiency and Network Fractality

Network dismantling is to identify a minimal set of nodes whose removal breaks the network into small components of subextensive size. Because finding the optimal set of nodes is an NP-hard problem, several heuristic algorithms have been developed as alternative methods, for instance, the so-called belief propagation-based decimation (BPD) algorithm and the collective influence (CI) algorithm. Here, we test the performance of each of these algorithms and analyze them in the perspective of the fractality of the network. Networks are classified into two types: fractal and non-fractal networks. Real-world examples include the World Wide Web and Internet at the autonomous system level, respectively. They have different ratios of long-range shortcuts to short-range ones. We find that the BPD algorithm works more efficiently for fractal networks than for non-fractal networks, whereas the opposite is true of the CI algorithm. Furthermore, we construct diverse fractal and non-fractal model networks by controlling parameters such as the degree exponent, shortcut number, and system size, and investigate how the performance of the two algorithms depends on structural features.

physics.soc-ph↗

Metastable state en route to traveling-wave synchronization state

The Kuramoto model with mixed signs of couplings is known to produce a traveling-wave synchronized state. Here, we consider an abrupt synchronization transition from the incoherent state to the traveling-wave state through a long-lasting metastable state with large fluctuations. Our explanation of the metastability is that the dynamic flow remains within a limited region of phase space and circulates through a few active states bounded by saddle and stable fixed points. This complex flow generates a long-lasting critical behavior, a signature of a hybrid phase transition. We show that the long-lasting period can be controlled by varying the density of inhibitory/excitatory interactions. We discuss a potential application of this transition behavior to the recovery process of human consciousness.

cond-mat.stat-mech↗

Enhanced storage capacity with errors in scale-free Hopfield neural networks: an analytical study

The Hopfield model is a pioneering neural network model with associative memory retrieval. The analytical solution of the model in mean field limit revealed that memories can be retrieved without any error up to a finite storage capacity of $O(N)$, where $N$ is the system size. Beyond the threshold, they are completely lost. Since the introduction of the Hopfield model, the theory of neural networks has been further developed toward realistic neural networks using analog neurons, spiking neurons, etc. Nevertheless, those advances are based on fully connected networks, which are inconsistent with recent experimental discovery that the number of connections of each neuron seems to be heterogeneous, following a heavy-tailed distribution. Motivated by this observation, we consider the Hopfield model on scale-free networks and obtain a different pattern of associative memory retrieval from that obtained on the fully connected network: the storage capacity becomes tremendously enhanced but with some error in the memory retrieval, which appears as the heterogeneity of the connections is increased. Moreover, the error rates are also obtained on several real neural networks and are indeed similar to that on scale-free model networks.

cond-mat.dis-nn↗

Critical phenomena of a hybrid phase transition in cluster merging dynamics

Recently, a hybrid percolation transitions (HPT) that exhibits both a discontinuous transition and critical behavior at the same transition point has been observed in diverse complex systems. In spite of considerable effort to develop the theory of HPT, it is still incomplete, particularly when the transition is induced by cluster merging dynamics. Here, we aim to develop a theoretical framework of the HPT induced by such dynamics. We find that two correlation-length exponents are necessary for characterizing the giant cluster and finite clusters, respectively. Finite-size scaling method for the HPT is also introduced. The conventional formula of the fractal dimension in terms of the critical exponents is not valid. Neither the giant nor finite clusters are fractals but they have fractal boundaries.

cond-mat.stat-mech↗

Critical behavior of a two-step contagion model with multiple seeds

A two-step contagion model with a single seed serves as a cornerstone for understanding the critical behaviors and underlying mechanism of discontinuous percolation transitions induced by cascade dynamics. When the contagion spreads from a single seed, a cluster of infected and recovered nodes grows without any cluster merging process. However, when the contagion starts from multiple seeds of $O(N)$ where $N$ is the system size, a node weakened by a seed can be infected more easily when it is in contact with another node infected by a different pathogen seed. This contagion process can be viewed as a cluster merging process in a percolation model. Here, we show analytically and numerically that when the density of infectious seeds is relatively small but $O(1)$, the epidemic transition is hybrid, exhibiting both continuous and discontinuous behavior, whereas when it is sufficiently large and reaches a critical point, the transition becomes continuous. We determine the full set of critical exponents describing the hybrid and the continuous transitions. Their critical behaviors differ from those in the single-seed case.

cond-mat.stat-mech↗

Universal mechanism for hybrid percolation transitions

Hybrid percolation transitions (HPTs) induced by cascading processes have been observed in diverse complex systems such as $k$-core percolation, breakdown on interdependent networks and cooperative epidemic spreading models. Much effort has been devoted to describe the properties of HPTs of individual systems. Yet the fundamental question about the possible universal mechanism underlying those HPTs has not been investigated at a microscopic level. Here, we find that the discontinuity in the order parameter in such HPTs results from two steps: a durable critical branching (CB) and an explosive, supercritical (SC) process. In a random network of $N$ nodes at the transition the CB process persists for $O(N^{1/3})$ time and the remaining nodes become vulnerable. Those vulnerable nodes are activated then in the short SC process. This crossover mechanism and scaling behavior are universal for different HPT systems.

physics.soc-ph↗

Critical behavior of $k$-core percolation: Numerical studies

$k$-Core percolation has served as a paradigmatic model of discontinuous percolation for a long time. Recently it was revealed that the order parameter of $k$-core percolation of random networks additionally exhibits critical behavior. Thus $k$-core percolation exhibits a hybrid phase transition. Unlike the critical behaviors of ordinary percolation that are well understood, those of hybrid percolation transitions have not been thoroughly understood yet. Here, we investigate the critical behavior of $k$-core percolation of Erdős-Rényi networks. We find numerically that the fluctuations of the order parameter and the mean avalanche size diverge in different ways. Thus, we classify the critical exponents into two types: those associated with the order parameter and those with finite avalanches. The conventional scaling relations hold within each set, however, these two critical exponents are coupled. Finally we discuss some universal features of the critical behaviors of $k$-core percolation and the cascade failure model on multiplex networks.

cond-mat.stat-mech↗

Genuine Non-Self-Averaging and Ultra-Slow Convergence in Gelation

In irreversible aggregation processes droplets or polymers of microscopic size successively coalesce until a large cluster of macroscopic scale forms. This gelation transition is widely believed to be self-averaging, meaning that the order parameter (the relative size of the largest connected cluster) attains well-defined values upon ensemble averaging with no sample-to-sample fluctuations in the thermodynamic limit. Here, we report on anomalous gelation transition types. Depending on the growth rate of the largest clusters, the gelation transition can show very diverse patterns as a function of the control parameter, which includes multiple stochastic discontinuous transitions, genuine non-self-averaging and ultra-slow convergence of the transition point. Our framework may be helpful in understanding and controlling gelation.

cond-mat.stat-mech↗

Mixed-order phase transition in a two-step contagion model with single infectious seed

A hybrid phase transition (HPT) that exhibits properties of continuous and discontinuous phase transitions at the same transition point has been observed in diverse complex systems. Previous studies of the HPTs on complex networks mainly focused on whether the order parameter is continuous or discontinuous. However, more careful and fundamental questions on the critical behaviors of the HPT such as how the divergences of the susceptibility and of the correlation size are affected by the discontinuity of the order parameter have been addressed. Here, we consider a generalized epidemic model that is known to exhibit a discontinuous transition as a spinodal transition. Performing extensive numerical simulations and using finite-size scaling analysis, we examine diverging behaviors of the susceptibility and the correlation size. We find that when there is one infectious node and under a certain condition, the order parameter can exhibit a discontinuous jump but does not exhibit any critical behavior before or after the jump. This feature differs from what we observed in HPTs in the percolation pruning process. However, critical behavior appears in the form of a power-law behavior of the outbreak size distribution. The mean outbreak size, corresponding to the susceptibility, diverge following the conventional percolation behavior. Thus a mixed-order transition occurs. The hyperscaling relation does not hold.

cond-mat.stat-mech↗

Hybrid Phase Transition into an Absorbing State: Percolation and Avalanches

Interdependent networks are more fragile under random attacks than simplex networks, because interlayer dependencies lead to cascading failures and finally to a sudden collapse. This is a hybrid phase transition (HPT), meaning that at the transition point the order parameter has a jump but there are also critical phenomena related to it. Here we study these phenomena on the Erdős--Rényi and the two dimensional interdependent networks and show that the hybrid percolation transition exhibits two kinds of critical behaviors: divergence of the fluctuations of the order parameter and power-law size distribution of finite avalanches at a transition point. At the transition point, avalanches of infinite size occur thus the avalanche statistics also has the nature of a HPT. The exponent $β_m$ of the order parameter is $1/2$ under general conditions, while the value of the exponent $γ_m$ characterizing the fluctuations of the order parameter depends on the system. The critical behavior of the finite avalanches can be described by another set of exponents, $β_a$ and $γ_a$. These two critical behaviors are coupled by a scaling law: $1-β_m=γ_a$.

cond-mat.stat-mech↗

Hybrid Percolation Transition in Cluster Merging Processes: Continuously Varying Exponents

Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of $g$ fraction of the entire population in the smallest clusters. Here we show that this simple strategy for improving connection exhibits a phase transition barely studied before, namely a hybrid percolation transition exhibiting the properties of both first-order and second-order phase transitions. The cluster size distribution of finite clusters at a transition point exhibits power-law behavior with a continuously varying exponent $τ$ in the range $2 < τ(g) \le 2.5$. This pattern reveals a necessary condition for a hybrid transition in cluster aggregation processes, which is comparable to the power-law behavior of the avalanche size distribution arising in models with link-deleting processes in interdependent networks.

cond-mat.stat-mech↗

Two Types of Discontinuous Percolation Transitions in Cluster Merging Processes

Percolation is a paradigmatic model in disordered systems and has been applied to various natural phenomena. The percolation transition is known as one of the most robust continuous transitions. However, recent extensive studies have revealed that a few models exhibit a discontinuous percolation transition (DPT) in cluster merging processes. Unlike the case of continuous transitions, understanding the nature of discontinuous phase transitions requires a detailed study of the system at hand, which has not been undertaken yet for DPTs. Here we examine the cluster size distribution immediately before an abrupt increase in the order parameter of DPT models and find that DPTs induced by cluster merging kinetics can be classified into two types. Moreover, the type of DPT can be determined by the key characteristic of whether the cluster kinetic rule is homogeneous with respect to the cluster sizes. We also establish the necessary conditions for each type of DPT, which can be used effectively when the discontinuity of the order parameter is ambiguous, as in the explosive percolation model.

cond-mat.stat-mech↗

Forest Fire Model as a Supercritical Dynamic Model in Financial Systems

Recently, large-scale cascading failures in complex systems have garnered substantial attention. Such extreme events have been treated as an integral part of the self-organized criticality (SOC). Recent empirical work has suggested that some extreme events systematically deviate from the SOC paradigm, requiring a different theoretical framework. We shed additional theoretical light on this possibility by studying financial crisis. We build our model of financial crisis on the well-known forest fire model in scale-free networks. Our analysis shows a non-trivial scaling feature indicating supercritical behavior, which is independent of system size. Extreme events in the supercritical state result from bursting of a fat bubble, seeds of which are sown by a protracted period of a benign financial environment with few shocks. Our findings suggest that policymakers can control the magnitude of financial meltdowns by keeping the economy operating within reasonable duration of a benign environment.

q-fin.GN↗

Efficient algorithm to compute mutually connected components in interdependent networks

Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of links has thus far been absent. Here, using a well-known fully dynamic graph algorithm, we propose an efficient algorithm to accomplish this task. We show that the time complexity of this algorithm is approximately $O({N^{1.2} })$ for random graphs, which is more efficient than $O(N^{2})$ of the brute-force algorithm. We confirm the correctness of our algorithm by comparing the behavior of the order parameter as links are removed with existing results for three types of double-layer multiplex networks. We anticipate that this algorithm will be used for simulations of large-size systems that have been previously inaccessible.

cond-mat.stat-mech↗