اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSolvable Metric Growing Networks
46
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen to be embedded in a metric arrangement, where the geographic distance between vertices plays a crucial role. The present work proposes a model for growing network that takes into account the geographic distance between vertices: the probability that they are connected is higher if they are located nearer than farther. In this framework, the mean degree of vertices, degree distribution and shortest path length between two randomly chosen vertices are analysed.
قيم البحث
اقرأ أيضاً
In statistical physics any given system can be either at an equilibrium or away from it. Networks are not an exception. Most network models can be classified as either equilibrium or growing. Here we show that under certain conditions there exists an
equilibrium formulation for any growing network model, and vice versa. The equivalence between the equilibrium and nonequilibrium formulations is exact not only asymptotically, but even for any finite system size. The required conditions are satisfied in random geometric graphs in general and causal sets in particular, and to a large extent in some real networks.
A condensation transition was predicted for growing technological networks evolving by preferential attachment and competing quality of their nodes, as described by the fitness model. When this condensation occurs a node acquires a finite fraction
of all the links of the network. Earlier studies based on steady state degree distribution and on the mapping to Bose-Einstein condensation, were able to identify the critical point. Here we characterize the dynamics of condensation and we present evidence that below the condensation temperature there is a slow down of the dynamics and that a single node (not necessarily the best node in the network) emerges as the winner for very long times. The characteristic time t* at which this phenomenon occurs diverges both at the critical point and at $T -> 0$ when new links are attached deterministically to the highest quality node of the network.
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree distribution then t
hat distribution must be approximately scale-free with an exponent between 2 and 3. The diameter constraint can be interpreted as an environmental selection pressure that may help explain the scale-free nature of graphs for which data is available at different times in their growth. Two examples include graphs representing evolved biological pathways in cells and the topology of the Internet backbone. Our assumptions and explanation are found to be consistent with these data.
We study numerically a model of nonequilibrium networks where nodes and links are added at each time step with aging of nodes and connectivity- and age-dependent attachment of links. By varying the effects of age in the attachment probability we find
, with numerical simulations and scaling arguments, that a giant cluster emerges at a first-order critical point and that the problem is in the universality class of one dimensional percolation. This transition is followed by a change in the giant clusters topology from tree-like to quasi-linear, as inferred from measurements of the average shortest-path length, which scales logarithmically with system size in one phase and linearly in the other.
We examine the global organization of growing networks in which a new vertex is attached to already existing ones with a probability depending on their age. We find that the network is infinite- or finite-dimensional depending on whether the attachme
nt probability decays slower or faster than $(age)^{-1}$. The network becomes one-dimensional when the attachment probability decays faster than $(age)^{-2}$. We describe structural characteristics of these phases and transitions between them.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
