9 results on '"k-core percolation"'
Search Results
2. Possible origin for the similar phase transitions in k-core and interdependent networks
- Author
-
Shengling Gao, Leyang Xue, Bnaya Gross, Zhikun She, Daqing Li, and Shlomo Havlin
- Subjects
k-core percolation ,interdependent networks ,short-range influences ,long-range influences ,fractal fluctuations ,critical exponents ,Science ,Physics ,QC1-999 - Abstract
The models of k -core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered exponents in IN have not been explored in k -core percolation, and the origin of the similarity still remains unclear. Thus, in this paper, by considering k -core percolation on random networks, we first verify that the two newly discovered exponents (fractal fluctuation dimension, $d^{^{\prime}}_\textrm{f}$ , and correlation length exponent, $\nu^{^{\prime}}$ ) observed in d -dimensional IN spatial networks also exist with the same values in k -core percolation. That is, the fractality of the k -core giant component fluctuations is manifested by a fractal fluctuation dimension, $\widetilde d_\textrm{f} = 3/4$ , within a correlation size N ʹ that scales as $N^{^{\prime}} \propto (p-p_c)^{-\widetilde\nu}$ , with $\widetilde\nu = 2$ . Here we define, $\widetilde\nu \equiv d\cdot \nu^{^{\prime}}$ and $\widetilde{d}_\textrm{f} \equiv d^{^{\prime}}_\textrm{f}/d$ . This implies that both models, IN and k -core, feature the same scaling behaviors with the same critical exponents, further reinforcing the similarity between the two models. Furthermore, we suggest that these two models are similar since both have two types of interactions: short-range (SR) connectivity links and long-range (LR) influences. In IN the LR are the influences of dependency links while in k -core we find here that for k = 1 and k = 2 the influences are SR and in contrast for $k\unicode{x2A7E}3$ the influence is LR. In addition, analytical arguments for a universal hyper-scaling relation for the fractal fluctuation dimension of the k -core giant component and for IN as well as for any mixed-order transition are established. Our analysis enhances the comprehension of k -core percolation and supports the generalization of the concept of fractal fluctuations in mixed-order phase transitions.
- Published
- 2024
- Full Text
- View/download PDF
3. Robustness analysis of multi-dependency networks: [formula omitted]-core percolation and deliberate attacks.
- Author
-
Zhou, Lili, Liao, Haibin, Tan, Fei, and Yin, Jun
- Subjects
- *
PHASE transitions , *CRITICAL point (Thermodynamics) , *PERCOLATION , *DEFINITIONS - Abstract
The k -core percolation is an advantageous method for studying network robustness. Most of the existing research is based on multiplex networks with just one-to-one node dependencies, while in reality, a node may depend on a group of nodes, and there is a lack of research on k -core percolation in multi-dependency networks. To better address these practical needs, the percolation equation of k -core model on multi-dependency networks is derived with the definition of failure tolerance β. It reveals that at the critical point, the phase transition of k -core can be described as a hybrid first-order and continuous singular phase transitions; while when k = 1 , 2 and β = 1 , the phase transition behavior of k -core is second-order. The correctness of theoretical analysis is verified by performing simulations on E R − E R , S F − S F and E R − S F networks, in which the results indicate that increasing the failure tolerance β can effectively enhance the robustness of k -core structures in multi-dependency networks. Contrary to expectations, as the maximum size of the dependent cluster increasing, the robustness of k -core structures first decreases and then increases. Additionally, the results reveal that the critical points of k -core and the corona clusters are consistent. Based on this finding, an improved edge measurement method has been proposed, which can identify the critical links in corona clusters. By targeting these critical links, the network robustness can be reduced. Simulation results show that the given edge measure is not only superior to some basic methods but also beneficial for suppressing virus propagation. Nevertheless, the given framework can give help in understanding the overall hierarchy structure of networks and provide a foundation for further exploration of complex networks. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. How the Brain Transitions from Conscious to Subliminal Perception.
- Author
-
Arese Lucini, Francesca, Del Ferraro, Gino, Sigman, Mariano, and Makse, Hernán A.
- Subjects
- *
SUBLIMINAL perception , *BRAIN , *PERCOLATION theory , *PERCOLATION , *CONSCIOUSNESS - Abstract
We study the transition in the functional networks that characterize the human brains' conscious-state to an unconscious subliminal state of perception by using k -core percolation. We find that the most inner core (i.e., the most connected kernel) of the conscious-state functional network corresponds to areas which remain functionally active when the brain transitions from the conscious-state to the subliminal-state. That is, the inner core of the conscious network coincides with the subliminal-state. Mathematical modeling allows to interpret the conscious to subliminal transition as driven by k -core percolation, through which the conscious state is lost by the inactivation of the peripheral k -shells of the conscious functional network. Thus, the inner core and most robust component of the conscious brain corresponds to the unconscious subliminal state. This finding imposes constraints to theoretical models of consciousness, in that the location of the core of the functional brain network is in the unconscious part of the brain rather than in the conscious state as previously thought. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
5. Random node reinforcement and K-core structure of complex networks.
- Author
-
Ma, Rui, Hu, Yanqing, and Zhao, Jin-Hua
- Subjects
- *
COST benefit analysis , *RANDOM graphs , *COST functions , *DIRECT costing , *PHASE diagrams , *MODEL theory - Abstract
To enhance robustness of complex networked systems, a simple method is introducing reinforced nodes which always function during failure propagation. A random scheme of node reinforcement can be considered as a benchmark for finding an optimal reinforcement solution. Yet there still lacks a systematic evaluation on how node reinforcement affects network structure at a mesoscopic level upon failures. Here we study this problem through the lens of K -cores of networks. Based on an analytical percolation framework, we first show that, on uncorrelated random graphs, with a critical size of reinforced nodes, an abrupt emergence of K -cores is smoothed out to a continuous one, and a detailed phase diagram is derived. We then show that, with a cost–benefit analysis on random reinforcement, for proper weight factors in cost functions with constant and increasing marginal costs, a gain function shows a unimodality, thus we can analytically find an optimal reinforcement fraction by locating the maximal gain. In all, our framework offers a gain-oriented analytical perspective to designing robust interconnected systems. • We define a K -core percolation model with reinforced nodes on a network. • We develop a theory for the model on random graphs with random node reinforcement. • We analyze hybrid-to-continuous transition behaviors in the model. • We locate optimal fractions for random reinforcement with a cost–benefit analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
6. How the brain transitions from conscious to subliminal perception
- Author
-
Mariano Sigman, Francesca Arese Lucini, Gino Del Ferraro, and Hernán A. Makse
- Subjects
Data Analysis ,0301 basic medicine ,Physics - Physics and Society ,PERCOLATION THEORY ,Unconscious mind ,Consciousness ,media_common.quotation_subject ,Models, Neurological ,FOS: Physical sciences ,purl.org/becyt/ford/1.7 [https] ,Physics and Society (physics.soc-ph) ,Subliminal Stimulation ,Article ,Functional networks ,purl.org/becyt/ford/1 [https] ,03 medical and health sciences ,0302 clinical medicine ,Perception ,Humans ,Computer Simulation ,Physics - Biological Physics ,media_common ,Cognitive science ,K-CORE PERCOLATION ,Brain Mapping ,Percolation (cognitive psychology) ,General Neuroscience ,Transition (fiction) ,Subliminal stimuli ,Brain ,Conscious State ,Magnetic Resonance Imaging ,BRAIN NETWORKS ,030104 developmental biology ,Biological Physics (physics.bio-ph) ,CONSCIOUS AND SUBLIMINAL PERCEPTION ,Quantitative Biology - Neurons and Cognition ,FOS: Biological sciences ,Visual Perception ,Neurons and Cognition (q-bio.NC) ,Nerve Net ,Psychology ,030217 neurology & neurosurgery - Abstract
We study the transition in the functional networks that characterize the human brains’ conscious-state to an unconscious subliminal state of perception by using k-core percolation. We find that the most inner core (i.e., the most connected kernel) of the conscious-state functional network corresponds to areas which remain functionally active when the brain transitions from the conscious-state to the subliminal-state. That is, the inner core of the conscious network coincides with the subliminal-state. Mathematical modeling allows to interpret the conscious to subliminal transition as driven by k-core percolation, through which the conscious state is lost by the inactivation of the peripheral k-shells of the conscious functional network. Thus, the inner core and most robust component of the conscious brain corresponds to the unconscious subliminal state. This finding imposes constraints to theoretical models of consciousness, in that the location of the core of the functional brain network is in the unconscious part of the brain rather than in the conscious state as previously thought. Fil: Arese Lucini, Francesca. City University of New York. The City College of New York; Estados Unidos Fil: Del Ferraro, Gino. City University of New York. The City College of New York; Estados Unidos. Memorial Sloan-kettering Cancer Center.; Estados Unidos Fil: Sigman, Mariano. Universidad Torcuato Di Tella; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nebrija; Fil: Makse, Hernán Alejandro. City University of New York. The City College of New York; Estados Unidos
- Published
- 2019
7. Influencer identification in dynamical complex systems.
- Author
-
Pei S, Wang J, Morone F, and Makse HA
- Abstract
The integrity and functionality of many real-world complex systems hinge on a small set of pivotal nodes, or influencers. In different contexts, these influencers are defined as either structurally important nodes that maintain the connectivity of networks, or dynamically crucial units that can disproportionately impact certain dynamical processes. In practice, identification of the optimal set of influencers in a given system has profound implications in a variety of disciplines. In this review, we survey recent advances in the study of influencer identification developed from different perspectives, and present state-of-the-art solutions designed for different objectives. In particular, we first discuss the problem of finding the minimal number of nodes whose removal would breakdown the network (i.e. the optimal percolation or network dismantle problem), and then survey methods to locate the essential nodes that are capable of shaping global dynamics with either continuous (e.g. independent cascading models) or discontinuous phase transitions (e.g. threshold models). We conclude the review with a summary and an outlook., (© The authors 2019. Published by Oxford University Press. All rights reserved.)
- Published
- 2020
- Full Text
- View/download PDF
8. Tricritical Point in Heterogeneousk-Core Percolation
- Author
-
Kenneth A. Dawson, Davide Cellai, Aonghus Lawlor, James P. Gleeson, and SFI
- Subjects
Physics ,Percolation critical exponents ,TCPs ,Statistical Mechanics (cond-mat.stat-mech) ,FOS: Physical sciences ,General Physics and Astronomy ,Binary number ,Percolation threshold ,Disordered Systems and Neural Networks (cond-mat.dis-nn) ,Condensed Matter - Disordered Systems and Neural Networks ,01 natural sciences ,Directed percolation ,010305 fluids & plasmas ,Tricritical point ,k-core percolation ,0103 physical sciences ,Continuum percolation theory ,Statistical physics ,010306 general physics ,Critical exponent ,Scaling ,Condensed Matter - Statistical Mechanics ,tricritical points - Abstract
$k$-core percolation is an extension of the concept of classical percolation and is particularly relevant to understanding the resilience of complex networks under random damage. A new analytical formalism has been recently proposed to deal with heterogeneous $k$-cores, where each vertex is assigned a local threshold ${k}_{i}$. In this Letter we identify a binary mixture of heterogeneous $k$-cores which exhibits a tricritical point. We investigate the new scaling scenario and calculate the relevant critical exponents, by analytical and computational methods, for Erd\ifmmode \mbox{\H{o}}\else \H{o}\fi{}s-R\'enyi networks and 2D square lattices.
- Published
- 2011
- Full Text
- View/download PDF
9. Statistical physics of cascading failures in complex networks
- Author
-
Panduranga, Nagendra Kumar
- Subjects
- Physics, Cascading failures, Complex networks, Interdependent networks, k-Core percolation, Percolation theory
- Abstract
Systems such as the power grid, world wide web (WWW), and internet are categorized as complex systems because of the presence of a large number of interacting elements. For example, the WWW is estimated to have a billion webpages and understanding the dynamics of such a large number of individual agents (whose individual interactions might not be fully known) is a challenging task. Complex network representations of these systems have proved to be of great utility. Statistical physics is the study of emergence of macroscopic properties of systems from the characteristics of the interactions between individual molecules. Hence, statistical physics of complex networks has been an effective approach to study these systems. In this dissertation, I have used statistical physics to study two distinct phenomena in complex systems: i) Cascading failures and ii) Shortest paths in complex networks. Understanding cascading failures is considered to be one of the “holy grails“ in the study of complex systems such as the power grid, transportation networks, and economic systems. Studying failures of these systems as percolation on complex networks has proved to be insightful. Previously, cascading failures have been studied extensively using two different models: k-core percolation and interdependent networks. The first part of this work combines the two models into a general model, solves it analytically, and validates the theoretical predictions through extensive computer simulations. The phase diagram of the percolation transition has been systematically studied as one varies the average local k-core threshold and the coupling between networks. The phase diagram of the combined processes is very rich and includes novel features that do not appear in the models which study each of the processes separately. For example, the phase diagram consists of first- and second-order transition regions separated by two tricritical lines that merge together and enclose a two-stage transition region. In the two-stage transition, the size of the giant component undergoes a first-order jump at a certain occupation probability followed by a continuous second-order transition at a smaller occupation probability. Furthermore, at certain fixed interdependencies, the percolation transition cycles from first-order to second-order to two-stage to first-order as the k-core threshold is increased. We setup the analytical equations describing the phase boundaries of the two-stage transition region and we derive the critical exponents for each type of transition. Understanding the shortest paths between individual elements in systems like communication networks and social media networks is important in the study of information cascades in these systems. Often, large heterogeneity can be present in the connections between nodes in these networks. Certain sets of nodes can be more highly connected among themselves than with the nodes from other sets. These sets of nodes are often referred to as ’communities’. The second part of this work studies the effect of the presence of communities on the distribution of shortest paths in a network using a modular Erdős-Rényi network model. In this model, the number of communities and the degree of modularity of the network can be tuned using the parameters of the model. We find that the model reaches a percolation threshold while tuning the degree of modularity of the network and the distribution of the shortest paths in the network can be used as an indicator of how the communities are connected.
- Published
- 2017
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.