اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPartition of Networks into Basins of Attraction
191
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or attracted to its neighbor of maximal degree, as long as the degree is increasing. A node that has no neighbors of higher degree is a peak, attracting all the nodes in its basin. Maximally random scale-free networks exhibit different behavior based on their degree distribution exponent $gamma$: for small $gamma$ (broad distribution) networks are dominated by a giant basin, whereas for large $gamma$ (narrow distribution) there are numerous basins, with peaks attracting mainly their nearest neighbors. We derive expressions for the first two moments of the number of basins. We also obtain the complete distribution of basin sizes for a class of hierarchical deterministic scale-free networks that resemble random nets. Finally, we generalize the problem to regular networks and lattices where all degrees are equal, and thus the attractiveness of a node must be determined by an assigned weight, rather than the degree. We derive the complete distribution of basins of attraction resulting from randomly assigned weights in one-dimensional chains.
قيم البحث
اقرأ أيضاً
The basin of attraction is the set of initial points that will eventually converge to some attracting set. Its knowledge is important in understanding the dynamical behavior of a given dynamical system of interest. In this work, we address the proble
m of reconstructing the basins of attraction of a multistable system, using only labeled data. To this end, we view this problem as a classification task and use a deep neural network as a classifier for predicting the attractor that corresponds to any given initial condition. Additionally, we provide a method for obtaining an approximation of the basin boundary of the underlying system, using the trained classification model. Finally, we provide evidence relating the complexity of the structure of the basins of attraction with the quality of the obtained reconstructions, via the concept of basin entropy. We demonstrate the application of the proposed method on the Lorenz system in a bistable regime.
We present an experiment that systematically probes the basins of attraction of two fixed points of a nonlinear nanomechanical resonator and maps them out with high resolution. We observe a separatrix which progressively alters shape for varying driv
e strength and changes the relative areas of the two basins of attraction. The observed separatrix is blurred due to ambient fluctuations, including residual noise in the drive system, which cause uncertainty in the preparation of an initial state close to the separatrix. We find a good agreement between the experimentally mapped and theoretically calculated basins of attraction.
In this paper, we investigate geometric properties of monotone systems by studying their isostables and basins of attraction. Isostables are boundaries of specific forward-invariant sets defined by the so-called Koopman operator, which provides a lin
ear infinite-dimensional description of a nonlinear system. First, we study the spectral properties of the Koopman operator and the associated semigroup in the context of monotone systems. Our results generalize the celebrated Perron-Frobenius theorem to the nonlinear case and allow us to derive geometric properties of isostables and basins of attraction. Additionally, we show that under certain conditions we can characterize the bounds on the basins of attraction under parametric uncertainty in the vector field. We discuss computational approaches to estimate isostables and basins of attraction and illustrate the results on two and four state monotone systems.
In this paper, we study geometric properties of basins of attraction of monotone systems. Our results are based on a combination of monotone systems theory and spectral operator theory. We exploit the framework of the Koopman operator, which provides
a linear infinite-dimensional description of nonlinear dynamical systems and spectral operator-theoretic notions such as eigenvalues and eigenfunctions. The sublevel sets of the dominant eigenfunction form a family of nested forward-invariant sets and the basin of attraction is the largest of these sets. The boundaries of these sets, called isostables, allow studying temporal properties of the system. Our first observation is that the dominant eigenfunction is increasing in every variable in the case of monotone systems. This is a strong geometric property which simplifies the computation of isostables. We also show how variations in basins of attraction can be bounded under parametric uncertainty in the vector field of monotone systems. Finally, we study the properties of the parameter set for which a monotone system is multistable. Our results are illustrated on several systems of two to four dimensions.
We systematically study and compare damage spreading at the sparse percolation (SP) limit for random boolean and threshold networks with perturbations that are independent of the network size $N$. This limit is relevant to information and damage prop
agation in many technological and natural networks. Using finite size scaling, we identify a new characteristic connectivity $K_s$, at which the average number of damaged nodes $bar d$, after a large number of dynamical updates, is independent of $N$. Based on marginal damage spreading, we determine the critical connectivity $K_c^{sparse}(N)$ for finite $N$ at the SP limit and show that it systematically deviates from $K_c$, established by the annealed approximation, even for large system sizes. Our findings can potentially explain the results recently obtained for gene regulatory networks and have important implications for the evolution of dynamical networks that solve specific computational or functional tasks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
