اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGoogle matrix and Ulam networks of intermittency maps
213
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the properties of the Google matrix of an Ulam network generated by intermittency maps. This network is created by the Ulam method which gives a matrix approximant for the Perron-Frobenius operator of dynamical map. The spectral properties of eigenvalues and eigenvectors of this matrix are analyzed. We show that the PageRank of the system is characterized by a power law decay with the exponent $beta$ dependent on map parameters and the Google damping factor $alpha$. Under certain conditions the PageRank is completely delocalized so that the Google search in such a situation becomes inefficient.
قيم البحث
اقرأ أيضاً
We study the properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation. The finite size matrix approximant of this operator is constructed by the Ulam method. This method appl
ied to the simple dynamical model creates the directed Ulam networks with approximate scale-free scaling and characteristics being rather similar to those of the World Wide Web. The simple dynamical attractors play here the role of popular web sites with a strong concentration of PageRank. A variation of the Google parameter $alpha$ or other parameters of the dynamical map can drive the PageRank of the Google matrix to a delocalized phase with a strange attractor where the Google search becomes inefficient.
We study numerically the spectrum and eigenstate properties of the Google matrix of various examples of directed networks such as vocabulary networks of dictionaries and university World Wide Web networks. The spectra have gapless structure in the vi
cinity of the maximal eigenvalue for Google damping parameter $alpha$ equal to unity. The vocabulary networks have relatively homogeneous spectral density, while university networks have pronounced spectral structures which change from one university to another, reflecting specific properties of the networks. We also determine specific properties of eigenstates of the Google matrix, including the PageRank. The fidelity of the PageRank is proposed as a new characterization of its stability.
Using parallels with the quantum scattering theory, developed for processes in nuclear and mesoscopic physics and quantum chaos, we construct a reduced Google matrix $G_R$ which describes the properties and interactions of a certain subset of selecte
d nodes belonging to a much larger directed network. The matrix $G_R$ takes into account effective interactions between subset nodes by all their indirect links via the whole network. We argue that this approach gives new possibilities to analyze effective interactions in a group of nodes embedded in a large directed networks. Possible efficient numerical methods for the practical computation of $G_R$ are also described.
We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention in the interplay between networks topological disorder and its synchronization features. Firstly, we analyze synchronization time $T
$ in random networks, and find a scaling law which relates $T$ to networks connectivity. Then, we carry on comparing synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than any other disordered network. The fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to have a non-random topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.
We investigate the stability of synchronized states in delay-coupled networks where synchronization takes place in groups of different local dynamics or in cluster states in networks with identical local dynamics. Using a master stability approach, w
e find that the master stability function shows a discrete rotational symmetry depending on the number of groups. The coupling matrices that permit solutions on group or cluster synchronization manifolds show a very similar symmetry in their eigenvalue spectrum, which helps to simplify the evaluation of the master stability function. Our theory allows for the characterization of stability of different patterns of synchronized dynamics in networks with multiple delay times, multiple coupling functions, but also with multiple kinds of local dynamics in the networks nodes. We illustrate our results by calculating stability in the example of delay-coupled semiconductor lasers and in a model for neuronal spiking dynamics.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
