اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStructural instability of large-scale functional networks
58
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study how large functional networks can grow stably under possible cascading overload failures and evaluated the maximum stable network size above which even a small-scale failure would cause a fatal breakdown of the network. Employing a model of cascading failures induced by temporally fluctuating loads, the maximum stable size $n_{text{max}}$ has been calculated as a function of the load reduction parameter $r$ that characterizes how quickly the total load is reduced during the cascade. If we reduce the total load sufficiently fast ($rge r_{text{c}}$), the network can grow infinitely. Otherwise, $n_{text{max}}$ is finite and increases with $r$. For a fixed $r,(<r_{text{c}})$, $n_{text{max}}$ for a scale-free network is larger than that for an exponential network with the same average degree. We also discuss how one detects and avoids the crisis of a fatal breakdown of the network from the relation between the sizes of the initial network and the largest component after an ordinarily occurring cascading failure.
قيم البحث
اقرأ أيضاً
Production in an economy is a set of firms activities as suppliers and customers; a firm buys goods from other firms, puts value added and sells products to others in a giant network of production. Empirical study is lacking despite the fact that the
structure of the production network is important to understand and make models for many aspects of dynamics in economy. We study a nation-wide production network comprising a million firms and millions of supplier-customer links by using recent statistical methods developed in physics. We show in the empirical analysis scale-free degree distribution, disassortativity, correlation of degree to firm-size, and community structure having sectoral and regional modules. Since suppliers usually provide credit to their customers, who supply it to theirs in turn, each link is actually a creditor-debtor relationship. We also study chains of failures or bankruptcies that take place along those links in the network, and corresponding avalanche-size distribution.
Perhaps the largest debate in network Ecology, the emergence of structural patterns stands out as a multifaceted problem. To the methodological challenges -- pattern identification, statistical significance -- one has to add the relationship between
candidate architectures and dynamical performance. In the case of mutualistic communities, the debate revolves mostly around two structural arrangements (nestedness and modularity) and two requirements for persistence, namely feasibility and stability. So far, it is clear that the former is strongly related to nestedness, while the latter is enhanced in modular systems. Adding to this, it has recently become clear that nestedness and modularity are antagonistic patterns -- or, at the very least, their coexistence in a single system is problematic. In this context, this work addresses the role of the interaction architecture in the emergence and maintenance of both properties, introducing the idea of hybrid architectural configurations. Specifically, we examine in-block nestedness, compound by disjoint subsets of species (modules) with internal nested organization, and prove that it grants a balanced trade-off between stability and feasibility. Remarkably, we analyze a large amount of empirical communities and find that a relevant fraction of them exhibits a marked in-block nested structure. We elaborate on the implications of these results, arguing that they provide new insights about the key properties ruling community assembly.
Despite the vast amount of studies on pedestrian flow, the data concerning high densities are still very inadequate. We organize one large-scale pedestrian flow experiment on a ring corridor. With 278 participants, the density as high as 9 m^(-2) is
reached. In the uni-directional flow, four different states are observed, including the free flow, congested state, over-congested state and hyper-congested state. The features of the hyper-congested state are similar to the crowd turbulence reported in the empirical data of Helbing et al., and the transition between the stopped state and the moving state can be found. The flow rates in the over-congested state are nearly constant, due to the downstream propagation of pedestrian clusters. In the bi-directional flow, three different types of lane formations are observed in the experiment: (1) three lanes are directly formed ; (2) two lanes are directly formed; (3) firstly three lanes are formed, and then they transit into two lanes. After the lane formation, some interesting phenomena have been observed, including the inhomogeneous distribution of pedestrians across the lanes, and the formation and dissipation of localized crowd. Our study is expected to help for better understanding and modeling the dynamics of high density pedestrian flow.
Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as synchronization and ca
scading processes on networks. Here we develop a theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network. We demonstrate the effectiveness of our approximation schemes using both real and artificial networks, showing in particular that we can accurately obtain the spectral ranking of small subgraphs. We also propose a local iterative scheme which computes the relative ranking of a subgraph using only the connectivity information of its neighbors within a few links. Our results may not only contribute to our theoretical understanding of dynamical processes on networks, but also lead to practical applications in ranking subgraphs of real complex networks.
The relationship of network structure and dynamics is one of most extensively investigated problems in the theory of complex systems of the last years. Understanding this relationship is of relevance to a range of disciplines -- from Neuroscience to
Geomorphology. A major strategy of investigating this relationship is the quantitative comparison of a representation of network architecture (structural connectivity) with a (network) representation of the dynamics (functional connectivity). Analysing such SC/FC relationships has over the past years contributed substantially to our understanding of the functional role of network properties, such as modularity, hierarchical organization, hubs and cycles. Here, we show that one can distinguish two classes of functional connectivity -- one based on simultaneous activity (co-activity) of nodes the other based on sequential activity of nodes. We delineate these two classes in different categories of dynamical processes -- excitations, regular and chaotic oscillators -- and provide examples for SC/FC correlations of both classes in each of these models. We expand the theoretical view of the SC/FC relationships, with conceptual instances of the SC and the two classes of FC for various application scenarios in Geomorphology, Freshwater Ecology, Systems Biology, Neuroscience and Social-Ecological Systems. Seeing the organization of a dynamical processes in a network either as governed by co-activity or by sequential activity allows us to bring some order in the myriad of observations relating structure and function of complex networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
