arXiv subjects

K. -I. Goh

Publications and source records attributed to K. -I. Goh.

At least 19 recordsLinked to original sources

arXiv2026

Competing heterogeneities shape ordering via higher-order interactions

Higher-order interactions admit richer structural heterogeneity than pairwise networks. To understand how heterogeneity impacts collective phenomena we develop a framework based on the cavity method and apply it to the simplicial Ising model on heterogeneous hypergraphs. Unlike in homogeneous structures, group size and node degree play fundamentally different roles: size heterogeneity sharpens the transition via large-group unanimity, while degree heterogeneity softens it as hubs cooperatively seed ordering with non-hubs. Under either type of heterogeneity, continuous--discontinuous double transitions can arise, where the symmetry-breaking continuous transition is driven by pairs or by hubs, respectively. When both heterogeneities coexist, cross-order degree correlations further modulate the phase diagram, with anticorrelation delaying the group-driven discontinuous jump and broadening the hysteretic region. Our results reveal the intricate interplay between size and degree heterogeneities in collective phenomena beyond pairwise interactions.

cond-mat.stat-mech↗

arXiv2026

Optimality in group-driven social dynamics on hypergraphs

We explore the role of intrinsic structural properties of hypergraphs in governing group-driven social dynamics with social reinforcement. First, we analyze simplicial contagion dynamics on random hypergraphs in which the level of hyperedge nestedness is systematically controlled. By developing the facet-based approximate master equation (FAME) method, we demonstrate that hyperedge nestedness induces a non-monotonic change in the outbreak threshold for simplicial contagion, displaying the lowest threshold at an intermediate level of hyperedge nestedness due to competition between simple and higher-order contagion processes. Next, we formulate the group-driven voter model (GVM) and investigate the consensus time for the GVM on hypergraphs with N nodes. Focusing on a representative case of the GVM, we show that the consensus time scales logarithmically with the system size as A ln N, where the prefactor A displays the fastest consensus formation at an intermediate level of social reinforcement due to competition between group-constraint and nonlinearity factors. Taken together, our results highlight the importance of competing effects arising from higher-order interactions in shaping optimality in group-driven social dynamical processes.

physics.soc-ph↗

arXiv2026

Structure and dynamics jointly stabilize the international trade hypergraph

To understand how fluctuations arise and are distributed in international trade, a question crucial for economic risk assessment and policymaking, we analyze strong adverse fluctuations-collapsed trades-defined as individual trades with sharp annual volume declines. Adopting a hypergraph framework for a fine-scale trade-centric representation of international trade, we find that collapsed trades (hyperedges) are clustered and their occurrence decays algebraically with trade volume (weight), which suggests inhomogeneous, epidemic-like spreading of collapse in the international trade hypergraph. Modeling collapse propagation as a contagion process and analyzing its dynamics, we show that a positive degree-weight correlation and a volume-decaying collapse rate synergistically suppress the onset of global collective collapse. Notably, the degree-weight correlation persisted but the volume-decay of the collapse rate weakened during the 2008-2009 global economic recession, resulting in a broader collapse spread. Our study shows how the interplay between structure and dynamics stabilizes complex systems.

physics.soc-ph↗

arXiv2025

Equilibrium-preserving Laplacian renormalization group

Diffusion over networks has recently been used to define spatiotemporal scales and extend Kadanoff block spins of Euclidean space to supernodes of networks in the Laplacian renormalization group (LRG). Yet, its ad hoc coarse-graining procedure remains underdeveloped and unvalidated, limiting its broader applicability. Here we rigorously formulate an LRG preserving the equilibrium state, offering a principled coarse-graining procedure. We construct the renormalized Laplacian matrix preserving dominant spectral properties using a proper, quasi-complete basis transformation and the renormalized adjacency matrix preserving mean connectivity from equilibrium-state flows among supernodes. Applying recursively this equilibrium-preserving LRG to various hypergraphs, we find that in hypertrees with low spectral dimensions vertex degree and hyperedge cardinality distributions flow toward Poissonian forms, while in hypergraphs lacking a finite spectral dimension they broaden toward power-law forms when starting from Poissonian ones, revealing how informational, structural, and dynamical scale-invariances are interrelated.

cond-mat.stat-mech↗

arXiv2024

Competition between group interactions and nonlinearity in voter dynamics on hypergraphs

Social dynamics are often driven by both pairwise (i.e., dyadic) relationships and higher-order (i.e., polyadic) group relationships, which one can describe using hypergraphs. To gain insight into the impact of polyadic relationships on dynamical processes on networks, we formulate and study a polyadic voter process, which we call the group-driven voter model (GVM), that incorporates the effect of group interactions by nonlinear interactions that are subject to a group (i.e., hyperedge) constraint. By examining the competition between nonlinearity and group sizes, we show that the GVM achieves consensus faster than standard voter-model dynamics, with an optimal minimizing exit time. We substantiate this finding by using mean-field theory on annealed uniform hypergraphs with $N$ nodes, for which the exit time scales as ${\cal A}\ln N$, where the prefactor ${\cal A}$ depends both on the nonlinearity and on group-constraint factors. Our results reveal how competition between group interactions and nonlinearity shapes GVM dynamics. We thereby highlight the importance of such competing effects in complex systems with polyadic interactions.

physics.soc-ph↗

arXiv2024

No-exclaves percolation on random networks

No-exclaves percolation (NExP) is a nonlocal percolation process in which the components are formed not only by the connected occupied nodes but also by the agglomeration of empty nodes completely surrounded by the occupied nodes. It has been studied in low dimensions, displaying such novel phenomena as the discontinuous transition to complete percolation. However, its characteristics in complex networks are still unexplored. In this paper, we study the NExP on random networks by developing mean-field solutions using the generating function formalism. Our theory allows us to determine the size of the giant no-exclaves component as well as the percolation threshold, which are in excellent agreements with Monte Carlo simulations on random networks and some real-world networks. We show that on random networks NExP exhibits three phases and two transitions between them: the phases are characterized by the presence or absence of not only the giant NExP component but also the giant unoccupied component, which is the giant connected component composed solely of unoccupied nodes. This work offers theoretical understanding on the anatomy of phase transitions in the NExP process.

cond-mat.stat-mech↗

arXiv2024

Higher-Order Components Dictate Higher-Order Contagion Dynamics in Hypergraphs

The presence of the giant component is a necessary condition for the emergence of collective behavior in complex networked systems. Unlike networks, hypergraphs have an important native feature that components of hypergraphs might be of higher order, which could be defined in terms of the number of common nodes shared between hyperedges. Although the extensive higher-order component (HOC) could be witnessed ubiquitously in real-world hypergraphs, the role of the giant HOC in collective behavior on hypergraphs has yet to be elucidated. In this Letter, we demonstrate that the presence of the giant HOC fundamentally alters the outbreak patterns of higher-order contagion dynamics on real-world hypergraphs. Most crucially, the giant HOC is required for the higher-order contagion to invade globally from a single seed. We confirm it by using synthetic random hypergraphs containing adjustable and analytically calculable giant HOC.

physics.soc-ph↗

arXiv2023

Critical behaviors of cascading dynamics on multiplex two-dimensional lattices

We study the critical phenomena of viable clusters in multiplex two-dimensional lattices using numerical simulations. We identify viable sites on multiplex lattices using two cascading algorithms: the cascade of activations (CA) and deactivations (CD). We found that the giant viable clusters identified by CA and CD processes exhibit different critical behaviors. Specifically, the critical phenomena of CA processes are consistent with the ordinary bond percolation on a single layer but CD processes exhibit the critical behaviors consistent with mutual percolation on multiplex lattices. In addition, we computed the susceptibility of cascading dynamics by using the concept of ghost field. Our results suggest that the CA and CD processes generate viable clusters in different ways.

cond-mat.stat-mech↗

arXiv2023

Threshold cascade dynamics on signed random networks

Relationships between individuals in a social network, genes in biological systems, and spins in magnetic systems often reflect a mixture of positive (friendly) and negative (antagonistic) interactions. However, most studies of complex networks have focused on networks consisting of solely positive interactions. Here, we study threshold cascades on signed networks composed of both positive and negative connections, focusing on when a pair of nodes connected by a negative link can only be activated exclusively to each other. We found that the negative interactions not only suppress global cascades, but also induce the heterogeneity in activation patterns manifesting from single-node to network levels. Our results suggest that negative interactions may be an important source of the variability in cascading dynamics.

physics.soc-ph↗

arXiv2022

$K$-selective percolation: A simple model leading to a rich repertoire of phase transitions

We propose the $K$-selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree $K$ is deactivated one by one until no more nodes with degree $K$ remain. The non-monotonic response of the giant component size on various synthetic and real-world networks implies a conclusion that a network can be more robust against such selective attack by removing further edges. In the theoretical perspective, the $K$-selective percolation process exhibits a rich repertoire of phase transitions, including double transitions of hybrid and continuous, as well as reentrant transitions. Notably, we observe a tricritical-like point on Erdős-Rényi networks. We also examine a discontinuous transition with unusual order parameter fluctuation and distribution on simple cubic lattices, which does not appear in other percolation models with cascade processes. Finally, we perform finite-size scaling analysis to obtain critical exponents on various transition points, including those exotic ones.

cond-mat.dis-nn↗

arXiv2020

Critical behaviors of high-degree adaptive and collective-influence percolation

How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been studied in the literature; for instance, a simple random failure or high-degree adaptive (HDA) percolation. Recently a new attack strategy based on a quantity called collective-influence (CI) has been proposed from the perspective of optimal percolation. By successively deactivating the node having the largest CI-centrality value, it was shown to be able to dismantle a network more quickly and abruptly than many of the existing methods. In this paper, we focus on the critical behaviors of the percolation processes following degree-based attack and CI-based attack on random networks. Through extensive Monte Carlo simulations assisted by numerical solutions, we estimate various critical exponents of the HDA percolation and those of the CI percolations. Our results show that these attack-type percolation processes, despite displaying apparently more abrupt collapse, nevertheless exhibit standard mean-field critical behaviors at the percolation transition point. We further discover an extensive degeneracy in top-centrality nodes in both processes, which may provide a hint for understanding the observed results

physics.soc-ph↗

arXiv2018

Majority-vote dynamics on multiplex networks

Majority-vote model is a much-studied model for social opinion dynamics of two competing opinions. With the recent appreciation that our social network comprises a variety of different layers forming a multiplex network, a natural question arises on how such multiplex interactions affect the social opinion dynamics and consensus formation. Here, the majority-vote model will be studied on multiplex networks to understand the effect of multiplexity on opinion dynamics. We will discuss how global consensus is reached by different types of voters: AND- and OR-rule voters on multiplex-network and voters on single-network system. The AND-model reaches the largest consensus below the critical noise parameter qc. It needs, however, much longer time to reach consensus than other models. In the vicinity of the transition point, the consensus collapses abruptly. The OR-model attains smaller level of consensus than the AND-rule but reaches the consensus more quickly. Its consensus transition is continuous. The numerical simulation results are supported qualitatively by analytical calculations based on the approximate master equation.

physics.soc-ph↗

arXiv2018

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↗

arXiv2016

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↗

arXiv2014

Threshold cascades with response heterogeneity in multiplex networks

Threshold cascade models have been used to describe spread of behavior in social networks and cascades of default in financial networks. In some cases, these networks may have multiple kinds of interactions, such as distinct types of social ties or distinct types of financial liabilities; furthermore, nodes may respond in different ways to in influence from their neighbors of multiple types. To start to capture such settings in a stylized way, we generalize a threshold cascade model to a multiplex network in which nodes follow one of two response rules: some nodes activate when, in at least one layer, a large enough fraction of neighbors are active, while the other nodes activate when, in all layers, a large enough fraction of neighbors are active. Varying the fractions of nodes following either rule facilitates or inhibits cascades. Near the inhibition regime, global cascades appear discontinuously as the network density increases; however, the cascade grows more slowly over time. This behavior suggests a way in which various collective phenomena in the real world could appear abruptly yet slowly.

physics.soc-ph↗

arXiv2014

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↗

arXiv2014

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↗

arXiv2014

Network robustness of multiplex networks with interlayer degree correlations

We study the robustness properties of multiplex networks consisting of multiple layers of distinct types of links, focusing on the role of correlations between degrees of a node in different layers. We use generating function formalism to address various notions of the network robustness relevant to multiplex networks such as the resilience of ordinary- and mutual connectivity under random or targeted node removals as well as the biconnectivity. We found that correlated coupling can affect the structural robustness of multiplex networks in diverse fashion. For example, for maximally-correlated duplex networks, all pairs of nodes in the giant component are connected via at least two independent paths and network structure is highly resilient to random failure. In contrast, anti-correlated duplex networks are on one hand robust against targeted attack on high-degree nodes, but on the other hand they can be vulnerable to random failure.

physics.soc-ph↗