arXiv subjects

Run-Ran Liu

Publications and source records attributed to Run-Ran Liu.

16 recordsLinked to original sources

arXiv2025

Finite-size scaling of percolation on scale-free networks

Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify two distinct crossover routes to mean-field behavior: one controlled by the degree exponent $\lambda$, the other by the degree cutoff $K \sim V^{\kappa}$, where $V$ is the system size and $\kappa \in [0,1]$ is the cutoff exponent. Increasing $\lambda$ or decreasing $\kappa$ suppresses heterogeneity and drives the system toward mean-field behavior, with logarithmic corrections near the marginal case. These findings provide a unified picture of the crossover from heterogeneous to homogeneous criticality. In the crossover regime, we observe rich finite-size phenomena, including the transition from vanishing to divergent susceptibility, distinct exponents for the shift and fluctuation of pseudocritical points, and a numerical clarification of previous theoretical predictions.

cond-mat.stat-mech↗

arXiv2024

Cascading failures with group support in interdependent hypergraphs

The functionality of an entity frequently necessitates the support of a group situated in another layer of the system. To unravel the profound impact of such group support on a system's resilience against cascading failures, we devise a framework comprising a double-layer interdependent hypergraph system, wherein nodes are capable of receiving support via hyperedges. Our central hypothesis posits that the failure may transcend to another layer when all support groups of each dependent node fail, thereby initiating a potentially iterative cascade across layers. Through rigorous analytical methods, we derive the critical threshold for the initial node survival probability that marks the second-order phase transition point. A salient discovery is that as the prevalence of dependent nodes escalates, the system dynamics shift from a second-order to a first-order phase transition. Notably, irrespective of the collapse pattern, systems characterized by scale-free hyperdegree distributions within both hypergraph layers consistently demonstrate superior robustness compared to those adhering to Poisson hyperdegree distributions. In summary, our research underscores the paramount significance of group support mechanisms and intricate network topologies in determining the resilience of interconnected systems against the propagation of cascading failures. By exploring the interplay between these factors, we have gained insights into how systems can be designed or optimized to mitigate the risk of widespread disruptions, ensuring their continued functionality and stability in the face of adverse events.

physics.soc-ph↗

arXiv2024

A simple model of global cascades on random hypergraphs

This study introduces a comprehensive framework that situates information cascades within the domain of higher-order interactions, utilizing a double-threshold hypergraph model. We propose that individuals (nodes) gain awareness of information through each communication channel (hyperedge) once the number of information adopters surpasses a threshold $\phi_m$. However, actual adoption of the information only occurs when the cumulative influence across all communication channels exceeds a second threshold, $\phi_k$. We analytically derive the cascade condition for both the case of a single seed node using percolation methods and the case of any seed size employing mean-field approximation. Our findings underscore that when considering the fractional seed size, $r_0 \in (0,1]$, the connectivity pattern of the random hypergraph, characterized by the hyperdegree, $k$, and cardinality, $m$, distributions, exerts an asymmetric impact on the global cascade boundary. This asymmetry manifests in the observed differences in the boundaries of the global cascade within the $(\phi_m, \langle m \rangle)$ and $(\phi_k, \langle k \rangle)$ planes. However, as $r_0 \to 0$, this asymmetric effect gradually diminishes. Overall, by elucidating the mechanisms driving information cascades within a broader context of higher-order interactions, our research contributes to theoretical advancements in complex systems theory.

physics.soc-ph↗

arXiv2023

Cascading failure with memory effect in random networks

In many cases of attacks or failures, memory effects play a significant role. Therefore, we present a model that not only considers the dependencies between nodes but also incorporates the memory effects of attacks. Our research demonstrates that the survival probability of a random node reached by a random edge surpasses the inverse of the average degree ($1/{\langle k \rangle}$), and a giant component emerges regardless of the strength of dependencies. Moreover, if the dependency strength exceeds $1/{\langle k \rangle}$, the network experiences an abrupt collapse when an infinitesimally small fraction of nodes is removed, irrespective of the memory effect. Our proposed model provides insights into the interplay between dependencies between nodes, memory effects, and the network structures under attacks or failures. By considering these factors, we can better assess the vulnerability of complex systems and develop strategies to mitigate cascading failures.

physics.soc-ph↗

arXiv2023

Modeling opinion polarization under perception bias

Social networks have provided a platform for the effective exchange of ideas or opinions but also served as a hotbed of polarization. While much research attempts to explore different causes of opinion polarization, the effect of perception bias caused by the network structure itself is largely understudied. To this end, we propose a threshold model that simulates the evolution of opinions by taking into account the perception bias, which is the gap between global information and locally available information from the neighborhood within networks. Our findings suggest that polarization occurs when the collective stubbornness of the population exceeds a critical value which is largely affected by the perception bias. In addition, as the level of stubbornness grows, the occurrence of first-order and second-order phase transitions between consensus and polarization becomes more prevalent, and the types of these phase transitions rely on the initial proportion of active opinions. Notably, for regular network structures, a step-wise pattern emerges that corresponds to various levels of polarization and is strongly associated with the formation of echo chambers. Our research presents a valuable framework for investigating the connection between perception bias and opinion polarization and provides valuable insights for mitigating polarization in the context of biased information.

physics.soc-ph↗

arXiv2022

Disagreement and fragmentation in growing groups

The arise of disagreement is an emergent phenomenon that can be observed within a growing social group and, beyond a certain threshold, can lead to group fragmentation. To better understand how disagreement emerges, we introduce an analytically tractable model of group formation where individuals have multidimensional binary opinions and the group grows through a noisy homophily principle, i.e., like-minded individuals attract each other with exceptions occurring with some small probability. Assuming that the level of disagreement is correlated with the number of different opinions coexisting within the group, we find analytically and numerically that in growing groups disagreement emerges spontaneously regardless of how small the noise in the system is. Moreover, for groups of infinite size, fragmentation is inevitable. We also show that the model outcomes are robust under different group growth mechanisms.

physics.soc-ph↗

arXiv2021

Phase transitions in growing groups: How cohesion can persist

The cohesion of a social group is the group's tendency to remain united. It has important implications for the stability and survival of social organizations, such as political parties, research teams, or online groups. Empirical studies suggest that cohesion is affected by both the admission process of new members and the group size. Yet, a theoretical understanding of their interplay is still lacking. To this end, we propose a model where a group grows by a noisy admission process of new members who can be of two different types. Cohesion is defined in this framework as the fraction of members of the same type and the noise in the admission process represents the level of randomness in the evaluation of new candidates. The model can reproduce the empirically reported decrease of cohesion with the group size. When the admission of new candidates involves the decision of only one group member, the group growth causes a loss of cohesion even for infinitesimal levels of noise. However, when admissions require a consensus of several group members, there is a critical noise level below which the growing group remains cohesive. The nature of the transition between the cohesive and non-cohesive phases depends on the model parameters and forms a rich structure reminiscent of critical phenomena in ferromagnetic materials.

physics.soc-ph↗

arXiv2021

Percolation on complex networks: Theory and application

In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology and sociology, from the perspective of the heterogeneous interaction patterns of components composing the complex systems. As a paradigm for random and semi-random connectivity, percolation model plays a key role in the development of network science and its applications. On the one hand, the concepts and analytical methods, such as the emergence of the giant cluster, the finite-size scaling, and the mean-field method, which are intimately related to the percolation theory, are employed to quantify and solve some core problems of networks. On the other hand, the insights into the percolation theory also facilitate the understanding of networked systems, such as robustness, epidemic spreading, vital node identification, and community detection. Meanwhile, network science also brings some new issues to the percolation theory itself, such as percolation of strong heterogeneous systems, topological transition of networks beyond pairwise interactions, and emergence of a giant cluster with mutual connections. So far, the percolation theory has already percolated into the researches of structure analysis and dynamic modeling in network science. Understanding the percolation theory should help the study of many fields in network science, including the still opening questions in the frontiers of networks, such as networks beyond pairwise interactions, temporal networks, and network of networks. The intention of this paper is to offer an overview of these applications, as well as the basic theory of percolation transition on network systems.

physics.soc-ph↗

arXiv2019

Depth penetration and scope extension of failures in the cascading of multilayer networks

Real-world complex systems always interact with each other, which causes these systems to collapse in an avalanche or cascading manner in the case of random failures or malicious attacks. The robustness of multilayer networks has attracted great interest, where the modeling and theoretical studies of which always rely on the concept of multilayer networks and percolation methods. A straightforward and tacit assumption is that the interdependence across network layers is strong, which means that a node will fail entirely with the removal of all links if one of its interdependent neighbours fails. However, this oversimplification cannot describe the general form of interactions across the network layers in a real-world multilayer system. In this paper, we reveal the nature of the avalanche disintegration of general multilayer networks with arbitrary interdependency strength across network layers. Specifically, we identify that the avalanche process of the whole system can essentially be decomposed into two microscopic cascading dynamics in terms of the propagation direction of the failures: depth penetration and scope extension. In the process of depth penetration, the failures propagate from layer to layer, where the greater the number of failed nodes is, the greater the destructive power that will emerge in an interdependency group. In the process of scope extension, failures propagate with the removal of connections in each network layer. Under the synergy of the two processes, we find that the percolation transition of the system can be discontinuous or continuous with changes in the interdependency strength across network layers, which means that sudden system-wide collapse can be avoided by controlling the interdependency strength across network layers.

physics.soc-ph↗

arXiv2019

Asymmetry in interdependence makes a multilayer system more robust against cascading failures

Multilayer networked systems are ubiquitous in nature and engineering, and the robustness of these systems against failures is of great interest. A main line of theoretical pursuit has been percolation induced cascading failures, where interdependence between network layers is conveniently and tacitly assumed to be symmetric. In the real world, interdependent interactions are generally asymmetric. To uncover and quantify the impact of asymmetry in interdependence on network robustness, we focus on percolation dynamics in double-layer systems and implement the following failure mechanism: once a node in a network layer fails, the damage it can cause depends not only on its position in the layer but also on the position of its counterpart neighbor in the other layer. We find that the characteristics of the percolation transition depend on the degree of asymmetry, where the striking phenomenon of a switch in the nature of the phase transition from first- to second-order arises. We derive a theory to calculate the percolation transition points in both network layers, as well as the transition switching point, with strong numerical support from synthetic and empirical networks. Not only does our work shed light upon the factors that determine the robustness of multilayer networks against cascading failures, but it also provides a scenario by which the system can be designed or controlled to reach a desirable level of resilience.

cs.SI↗

arXiv2017

The "weak" interdependence of infrastructure systems produces mixed percolation transitions in multilayer networks

In this work, we propose an interdependent, multilayer network model and percolation process that matches infrastructures better than previous models by allowing some nodes to survive when their interdependent neighbors fail. We consider a node-to-link failure propagation mechanism and establish "weak" interdependence across layers via a tolerance parameter $\alpha$ which quantifies the likelihood that a node survives when one of its interdependent neighbors fails. We measure the robustness of any individual layer by the final size of its giant component. Analytical and numerical results show that weak interdependence produces a striking phenomenon: layers at different positions within the multilayer system experience distinct percolation transitions. Especially, layers with high super degree values percolate in an abrupt manner, while those with low super degree values exhibit both continuous and abrupt transitions. This novel phenomenon we call \emph{mixed percolation transitions} has significant implications for network robustness. Previous results that do not consider cascade tolerance and layer super degree may be under- or over-estimating the vulnerability of real systems. Moreover, since $\alpha$ represents a generic measure of various risk management strategies used to buffer infrastructure assets from cascades, our model reveals how nodal protection activities influence failure dynamics in interdependent, multilayer systems.

nlin.AO↗

arXiv2016

Percolation on networks with weak and heterogeneous dependency

In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths could be different between different nodes. We find that the heterogeneous dependency strength will make the system more robust, and for various distributions of dependency strengths both continuous and discontinuous percolation transitions can be found. For Erd\H{o}s-R\'{e}nyi networks, we prove that the crossing point of the continuous and discontinuous percolation transitions is dependent on the first five moments of the dependency strength distribution. This indicates that the discontinuous percolation transition on networks with dependency is determined not only by the dependency strength but also by its distribution. Furthermore, in the area of the continuous percolation transition, we also find that the critical point depends on the first and second moments of the dependency strength distribution. To validate the theoretical analysis, cases with two different dependency strengths and Gaussian distribution of dependency strengths are presented as examples.

cond-mat.stat-mech↗

arXiv2016

Roles of the spreading scope and effectiveness in spreading dynamics on multiplex networks

Comparing with single networks, the multiplex networks bring two main effects on the spreading process among individuals. First, the pathogen or information can be transmitted to more individuals through different layers at one time, which enlarges the spreading scope. Second, through different layers, an individual can also transmit the pathogen or information to the same individuals more than once at one time, which makes the spreading more effective. To understand the different roles of the spreading scope and effectiveness, we propose an epidemic model on multiplex networks with link overlapping, where the spreading effectiveness of each interaction as well as the variety of channels (spreading scope) can be controlled by the number of overlapping links. We find that for Poisson degree distribution, increasing the epidemic scope (the first effect) is more efficient than enhancing epidemic probability (the second effect) to facilitate the spreading process. However, for power-law degree distribution, the effects of the two factors on the spreading dynamics become complicated. Enhancing epidemic probability makes pathogen or rumor easier to outbreak in a finite system. But after that increasing epidemic scopes is still more effective for a wide spreading. Theoretical results along with reasonable explanation for these phenomena are all given in this paper, which indicates that the epidemic scope could play an important role in the spreading dynamics.

physics.soc-ph↗

arXiv2015

Cascading failures in coupled networks with both inner-dependency and inter-dependency links

We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We find that when most of dependency links are inner- or inter-ones, the coupled networks system is fragile and makes a discontinuous percolation transition. However, when the numbers of two types of dependency links are close to each other, the system is robust and makes a continuous percolation transition. This indicates that the high density of dependency links could not always lead to a discontinuous percolation transition as the previous studies. More interestingly, although the robustness of the system can be optimized by adjusting the ratio of the two types of dependency links, there exists a critical average degree of the networks for coupled random networks, below which the crossover of the two types of percolation transitions disappears, and the system will always demonstrate a discontinuous percolation transition. We also develop an approach to analyze this model, which is agreement with the simulation results well.

physics.soc-ph↗

arXiv2012

Aspiration-induced reconnection in spatial public goods game

In this Letter, we introduce an aspiration-induced reconnection mechanism into the spatial public goods game. A player will reconnect to a randomly chosen player if its payoff acquired from the group centered on the neighbor does not exceed the aspiration level. We find that an intermediate aspiration level can best promote cooperation. This optimal phenomenon can be explained by a negative feedback effect, namely, a moderate level of reconnection induced by the intermediate aspiration level induces can change the downfall of cooperators, and then facilitate the fast spreading of cooperation. While insufficient reconnection and excessive reconnection induced by low and high aspiration levels respectively are not conductive to such an effect. Moreover, we find that the intermediate aspiration level can lead to the heterogeneous distribution of degree, which will be beneficial to the evolution of cooperation.

physics.soc-ph↗

arXiv2008

Information filtering based on transferring similarity

In this Brief Report, we propose a new index of user similarity, namely the transferring similarity, which involves all high-order similarities between users. Accordingly, we design a modified collaborative filtering algorithm, which provides remarkably higher accurate predictions than the standard collaborative filtering. More interestingly, we find that the algorithmic performance will approach its optimal value when the parameter, contained in the definition of transferring similarity, gets close to its critical value, before which the series expansion of transferring similarity is convergent and after which it is divergent. Our study is complementary to the one reported in [E. A. Leicht, P. Holme, and M. E. J. Newman, Phys. Rev. E {\bf 73} 026120 (2006)], and is relevant to the missing link prediction problem.

physics.data-an↗