اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStatistical Properties of Avalanches in Networks
72
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We characterize the distributions of size and duration of avalanches propagating in complex networks. By an avalanche we mean the sequence of events initiated by the externally stimulated `excitation of a network node, which may, with some probability, then stimulate subsequent firings of the nodes to which it is connected, resulting in a cascade of firings. This type of process is relevant to a wide variety of situations, including neuroscience, cascading failures on electrical power grids, and epidemology. We find that the statistics of avalanches can be characterized in terms of the largest eigenvalue and corresponding eigenvector of an appropriate adjacency matrix which encodes the structure of the network. By using mean-field analyses, previous studies of avalanches in networks have not considered the effect of network structure on the distribution of size and duration of avalanches. Our results apply to individual networks (rather than network ensembles) and provide expressions for the distributions of size and duration of avalanches starting at particular nodes in the network. These findings might find application in the analysis of branching processes in networks, such as cascading power grid failures and critical brain dynamics. In particular, our results show that some experimental signatures of critical brain dynamics (i.e., power-law distributions of size and duration of neuronal avalanches), are robust to complex underlying network topologies.
قيم البحث
اقرأ أيضاً
We study the statistics of avalanches, as a response to an applied force, undergone by a particle hopping on a one dimensional lattice where the pinning forces at each site are independent and identically distributed (I.I.D), each drawn from a contin
uous $f(x)$. The avalanches in this model correspond to the inter-record intervals in a modified record process of I.I.D variables, defined by a single parameter $c>0$. This parameter characterizes the record formation via the recursive process $R_k > R_{k-1}-c$, where $R_k$ denotes the value of the $k$-th record. We show that for $c>0$, if $f(x)$ decays slower than an exponential for large $x$, the record process is nonstationary as in the standard $c=0$ case. In contrast, if $f(x)$ has a faster than exponential tail, the record process becomes stationary and the avalanche size distribution $pi(n)$ has a decay faster than $1/n^2$ for large $n$. The marginal case where $f(x)$ decays exponentially for large $x$ exhibits a phase transition from a non-stationary phase to a stationary phase as $c$ increases through a critical value $c_{rm crit}$. Focusing on $f(x)=e^{-x}$ (with $xge 0$), we show that $c_{rm crit}=1$ and for $c<1$, the record statistics is non-stationary. However, for $c>1$, the record statistics is stationary with avalanche size distribution $pi(n)sim n^{-1-lambda(c)}$ for large $n$. Consequently, for $c>1$, the mean number of records up to $N$ steps grows algebraically $sim N^{lambda(c)}$ for large $N$. Remarkably, the exponent $lambda(c)$ depends continously on $c$ for $c>1$ and is given by the unique positive root of $c=-ln (1-lambda)/lambda$. We also unveil the presence of nontrivial correlations between avalanches in the stationary phase that resemble earthquake sequences.
We study spectra of directed networks with inhibitory and excitatory couplings. We investigate in particular eigenvector localization properties of various model networks for different value of correlation among their entries. Spectra of random netwo
rks, with completely uncorrelated entries show a circular distribution with delocalized eigenvectors, where as networks with correlated entries have localized eigenvectors. In order to understand the origin of localization we track the spectra as a function of connection probability and directionality. As connections are made directed, eigenstates start occurring in complex conjugate pairs and the eigenvalue distribution combined with the localization measure shows a rich pattern. Moreover, for a very well distinguished community structure, the whole spectrum is localized except few eigenstates at boundary of the circular distribution. As the network deviates from the community structure there is a sudden change in the localization property for a very small value of deformation from the perfect community structure. We search for this effect for the whole range of correlation strengths and for different community configurations. Furthermore, we investigate spectral properties of a metabolic network of zebrafish, and compare them with those of the model networks.
We systematically study and compare damage spreading for random Boolean and threshold networks under small external perturbations (damage), a problem which is relevant to many biological networks. We identify a new characteristic connectivity $K_s$,
at which the average number of damaged nodes after a large number of dynamical updates is independent of the total number of nodes $N$. We estimate the critical connectivity for finite $N$ and show that it systematically deviates from the annealed approximation. Extending the approach followed in a previous study, we present new results indicating that internal dynamical correlations tend to increase not only the probability for small, but also for very large damage events, leading to a broad, fat-tailed distribution of damage sizes. These findings indicate that the descriptive and predictive value of averaged order parameters for finite size networks - even for biologically highly relevant sizes up to several thousand nodes - is limited.
In this work I will discuss some numerical results on the stability of the many-body localized phase to thermal inclusions. The work simplifies a recent proposal by Morningstar et al. [arXiv:2107.05642] and studies small disordered spin chains which
are perturbatively coupled to a Markovian bath. The critical disorder for avalanche stability of the canonical disordered Heisenberg chain is shown to exceed W>20. In stark contrast to the Anderson insulator, the avalanche threshold drifts considerably with system size, with no evidence of saturation in the studied regime. I will argue that the results are most easily explained by the absence of a many-body localized phase.
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free
graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
