اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWheel graph strategy for PEV localization of networks
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Investigation of eigenvector localization properties of complex networks is not only important for gaining insight into fundamental network problems such as network centrality measure, spectral partitioning, development of approximation algorithms, but also is crucial for understanding many real-world phenomena such as disease spreading, criticality in brain network dynamics. For a network, an eigenvector is said to be localized when most of its components take value near to zero, with a few components taking very high values. In this article, we devise a methodology to construct a principal eigenvector (PEV) localized network from a given input network. The methodology relies on adding a small component having a wheel graph to the given input network. By extensive numerical simulation and an analytical formulation based on the largest eigenvalue of the input network, we compute the size of the wheel graph required to localize the PEV of the combined network. Using the susceptible-infected-susceptible model, we demonstrate the success of this method for various models and real-world networks consider as input networks. We show that on such PEV localized networks, the disease gets localized within a small region of the network structure before the outbreaks. The study is relevant in controlling spreading processes on complex systems represented by networks.
قيم البحث
اقرأ أيضاً
Recommendations around epidemics tend to focus on individual behaviors, with much less efforts attempting to guide event cancellations and other collective behaviors since most models lack the higher-order structure necessary to describe large gather
ings. Through a higher-order description of contagions on networks, we model the impact of a blanket cancellation of events larger than a critical size and find that epidemics can suddenly collapse when interventions operate over groups of individuals rather than at the level of individuals. We relate this phenomenon to the onset of mesoscopic localization, where contagions concentrate around dominant groups.
Simple models of infectious diseases tend to assume random mixing of individuals, but real interactions are not random pairwise encounters: they occur within various types of gatherings such as workplaces, households, schools, and concerts, best desc
ribed by a higher-order network structure. We model contagions on higher-order networks using group-based approximate master equations, in which we track all states and interactions within a group of nodes and assume a mean-field coupling between them. Using the Susceptible-Infected-Susceptible dynamics, our approach reveals the existence of a mesoscopic localization regime, where a disease can concentrate and self-sustain only around large groups in the network overall organization. In this regime, the phase transition is smeared, characterized by an inhomogeneous activation of the groups. At the mesoscopic level, we observe that the distribution of infected nodes within groups of a same size can be very dispersed, even bimodal. When considering heterogeneous networks, both at the level of nodes and groups, we characterize analytically the region associated with mesoscopic localization in the structural parameter space. We put in perspective this phenomenon with eigenvector localization and discuss how a focus on higher-order structures is needed to discern the more subtle localization at the mesoscopic level. Finally, we discuss how mesoscopic localization affects the response to structural interventions and how this framework could provide important insights for a broad range of dynamics.
Based on a theoretical model for opinion spreading on a network, through avalanches, the effect of external field is now considered, by using methods from non-equilibrium statistical mechanics. The original part contains the implementation that the a
valanche is only triggered when a local variable (a so called awareness) reaches and goes above a threshold. The dynamical rules are constrained to be as simple as possible, in order to sort out the basic features, though more elaborated variants are proposed. Several results are obtained for a Erdos-Renyi network and interpreted through simple analytical laws, scale free or logistic map-like, i.e., (i) the sizes, durations, and number of avalanches, including the respective distributions, (ii) the number of times the external field is applied to one possible node before all nodes are found to be above the threshold, (iii) the number of nodes still below the threshold and the number of hot nodes (close to threshold) at each time step.
Interdependencies are ubiquitous throughout the world. Every real-world system interacts with and is dependent on other systems, and this interdependency affects their performance. In particular, interdependencies among networks make them vulnerable
to failure cascades, the effects of which are often catastrophic. Failure propagation fragments network components, disconnects them, and may cause complete systemic failure. We propose a strategy of avoiding or at least mitigating the complete destruction of a system of interdependent networks experiencing a failure cascade. Starting with a fraction $1-p$ of failing nodes in one network, we reconnect with a probability $gamma$ every isolated component to a functional giant component (GC), the largest connected cluster. We find that as $gamma$ increases the resilience of the system to cascading failure also increases. We also find that our strategy is more effective when it is applied in a network of low average degree. We solve the problem theoretically using percolation theory, and we find that the solution agrees with simulation results.
An avalanche or cascade occurs when one event causes one or more subsequent events, which in turn may cause further events in a chain reaction. Avalanching dynamics are studied in many disciplines, with a recent focus on average avalanche shapes, i.e
., the temporal profiles that characterize the growth and decay of avalanches of fixed duration. At the critical point of the dynamics the average avalanche shapes for different durations can be rescaled so that they collapse onto a single universal curve. We apply Markov branching process theory to derive a simple equation governing the average avalanche shape for cascade dynamics on networks. Analysis of the equation at criticality demonstrates that nonsymmetric average avalanche shapes (as observed in some experiments) occur for certain combinations of dynamics and network topology; specifically, on networks with heavy-tailed degree distributions. We give examples using numerical simulations of models for information spreading, neural dynamics, and behaviour adoption and we propose simple experimental tests to quantify whether cascading systems are in the critical state.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
