اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHierarchical and mixing properties of static complex networks emerging from the fluctuating classical random graphs
75
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to lead to a static complex network with an arbitrary connectivity distribution. In particular, a scale-free network with the hierarchical organization is constructed without assuming any knowledge about the global linking structure, in contrast to the preferential attachment rule for a growing network. The hierarchical and mixing properties of the static scale-free network thus constructed are studied. The present approach establishes a bridge between a scalar characterization of individual vertices and topology of an emerging complex network. The result may offer a clue for understanding the origin of a few abundance of connectivity distributions in a wide variety of static real-world networks.
قيم البحث
اقرأ أيضاً
Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $mathcal{P}_N(K,lambda)$ that a large $N times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a threshold $l
ambda$. The method allows to determine, in principle, all moments of $mathcal{P}_N(K,lambda)$, from which the typical sample to sample fluctuations can be fully characterized. For random graph models with localized eigenvectors, we show that the index variance scales linearly with $N gg 1$ for $|lambda| > 0$, with a model-dependent prefactor that can be exactly calculated. Explicit results are discussed for Erdos-Renyi and regular random graphs, both exhibiting a prefactor with a non-monotonic behavior as a function of $lambda$. These results contrast with rotationally invariant random matrices, where the index variance scales only as $ln N$, with an universal prefactor that is independent of $lambda$. Numerical diagonalization results confirm the exactness of our approach and, in addition, strongly support the Gaussian nature of the index fluctuations.
We show that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space. Fermi-Dirac statistics provides a physical interpretation of hy
perbolic distances as energies of links. The hidden space curvature affects the heterogeneity of the degree distribution, while clustering is a function of temperature. We embed the Internet into the hyperbolic plane, and find a remarkable congruency between the embedding and our hyperbolic model. Besides proving our model realistic, this embedding may be used for routing with only local information, which holds significant promise for improving the performance of Internet routing.
We study the dynamics of networks with coupling delay, from which the connectivity changes over time. The synchronization properties are shown to depend on the interplay of three time scales: the internal time scale of the dynamics, the coupling dela
y along the network links and time scale at which the topology changes. Concentrating on a linearized model, we develop an analytical theory for the stability of a synchronized solution. In two limit cases the system can be reduced to an effective topology: In the fast switching approximation, when the network fluctuations are much faster than the internal time scale and the coupling delay, the effective network topology is the arithmetic mean over the different topologies. In the slow network limit, when the network fluctuation time scale is equal to the coupling delay, the effective adjacency matrix is the geometric mean over the adjacency matrices of the different topologies. In the intermediate regime the system shows a sensitive dependence on the ratio of time scales, and specific topologies, reproduced as well by numerical simulations. Our results are shown to describe the synchronization properties of fluctuating networks of delay-coupled chaotic maps.
We generalize the static model by assigning a q-component weight on each vertex. We first choose a component $(mu)$ among the q components at random and a pair of vertices is linked with a color $mu$ according to their weights of the component $(mu)$
as in the static model. A (1-f) fraction of the entire edges is connected following this way. The remaining fraction f is added with (q+1)-th color as in the static model but using the maximum weights among the q components each individual has. This model is motivated by social networks. It exhibits similar topological features to real social networks in that: (i) the degree distribution has a highly skewed form, (ii) the diameter is as small as and (iii) the assortativity coefficient r is as positive and large as those in real social networks with r reaching a maximum around $f approx 0.2$.
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in
complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as non-interacting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
