اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدApproximating Spectral Impact of Structural Perturbations in Large Networks
218
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 cascading 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.
قيم البحث
اقرأ أيضاً
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.
We use a generic model for type-I excitability (known as the SNIPER or SNIC model) to describe the local dynamics of nodes within a network in the presence of non-zero coupling delays. Utilising the method of the Master Stability Function, we investi
gate the stability of the zero-lag synchronised dynamics of the network nodes and its dependence on the two coupling parameters, namely the coupling strength and delay time. Unlike in the FitzHugh-Nagumo model (a model for type-II excitability), there are parameter ranges where the stability of synchronisation depends on the coupling strength and delay time. One important implication of these results is that there exist complex networks for which the adding of inhibitory links in a small-world fashion may not only lead to a loss of stable synchronisation, but may also restabilise synchronisation or introduce multiple transitions between synchronisation and desynchronisation. To underline the scope of our results, we show using the Stuart-Landau model that such multiple transitions do not only occur in excitable systems, but also in oscillatory ones.
Eigenstates of fully many-body localized (FMBL) systems can be organized into spin algebras based on quasilocal operators called l-bits. These spin algebras define quasilocal l-bit measurement ($tau^z_i$) and l-bit flip ($tau^x_i$) operators. For a d
isordered Heisenberg spin chain in the MBL regime we approximate l-bit flip operators by finding them exactly on small windows of systems and extending them onto the whole system by exploiting their quasilocal nature. We subsequently use these operators to represent approximate eigenstates. We then describe a method to calculate products of local observables on these eigenstates for systems of size $L$ in $O(L^2)$ time. This algorithm is used to compute the error of the approximate eigenstates.
We study rare phase slips due to noise in synchronized Kuramoto oscillator networks. In the small-noise limit, we demonstrate that slips occur via large fluctuations to saddle phase-locked states. For tree topologies, slips appear between subgraphs t
hat become disconnected at a saddle-node bifurcation, where phase-locked states lose stability generically. This pattern is demonstrated for sparse networks with several examples. Scaling laws are derived and compared for different tree topologies. On the other hand, for dense networks slips occur between oscillators on the edges of the frequency distribution. If the distribution is discrete, the probability-exponent for large fluctuations to occur scales linearly with the system size. However, if the distribution is continuous, the probability is a constant in the large network limit, as individual oscillators fluctuate to saddles while all others remain fixed. In the latter case, the networks coherence is approximately preserved.
We consider synchronization of weighted networks, possibly with asymmetrical connections. We show that the synchronizability of the networks cannot be directly inferred from their statistical properties. Small local changes in the network structure c
an sensitively affect the eigenvalues relevant for synchronization, while the gross statistical network properties remain essentially unchanged. Consequently, commonly used statistical properties, including the degree distribution, degree homogeneity, average degree, average distance, degree correlation, and clustering coefficient, can fail to characterize the synchronizability of networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
