اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExact analytical solution of average path length for Apollonian networks
259
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact solution of average path length, $bar{d}_t$, for Apollonian networks. In contrast to the well-known numerical result $bar{d}_t propto (ln N_t)^{3/4}$ [Phys. Rev. Lett. textbf{94}, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmically as $bar{d}_t propto ln N_t$ in the infinite limit of network size $N_t$. The extensive numerical calculations completely agree with our closed-form solution.
قيم البحث
اقرأ أيضاً
Empirical evidence shows that the rate of irregular usage of English verbs exhibits discontinuity as a function of their frequency: the most frequent verbs tend to be totally irregular. We aim to qualitatively understand the origin of this feature by
studying simple agent--based models of language dynamics, where each agent adopts an inflectional state for a verb and may change it upon interaction with other agents. At the same time, agents are replaced at some rate by new agents adopting the regular form. In models with only two inflectional states (regular and irregular), we observe that either all verbs regularize irrespective of their frequency, or a continuous transition occurs between a low frequency state where the lemma becomes fully regular, and a high frequency one where both forms coexist. Introducing a third (mixed) state, wherein agents may use either form, we find that a third, qualitatively different behavior may emerge, namely, a discontinuous transition in frequency. We introduce and solve analytically a very general class of three--state models that allows us to fully understand these behaviors in a unified framework. Realistic sets of interaction rules, including the well-known Naming Game (NG) model, result in a discontinuous transition, in agreement with recent empirical findings. We also point out that the distinction between speaker and hearer in the interaction has no effect on the collective behavior. The results for the general three--state model, although discussed in terms of language dynamics, are widely applicable.
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting networks of all
scales over the typical random graph model. The relationships herein can allow researchers to better predict the shortest path of networks of almost any size.
We study the voter model and related random-copying processes on arbitrarily complex network structures. Through a representation of the dynamics as a particle reaction process, we show that a quantity measuring the degree of order in a finite system
is, under certain conditions, exactly governed by a universal diffusion equation. Whenever this reduction occurs, the details of the network structure and random-copying process affect only a single parameter in the diffusion equation. The validity of the reduction can be established with considerably less information than one might expect: it suffices to know just two characteristic timescales within the dynamics of a single pair of reacting particles. We develop methods to identify these timescales, and apply them to deterministic and random network structures. We focus in particular on how the ordering time is affected by degree correlations, since such effects are hard to access by existing theoretical approaches.
We demonstrate that the exact non-equilibrium steady state of the one-dimensional Heisenberg XXZ spin chain driven by boundary Lindblad operators can be constructed explicitly with a matrix product ansatz for the non-equilibrium density matrix where
the matrices satisfy a {it quadratic algebra}. This algebra turns out to be related to the quantum algebra $U_q[SU(2)]$. Coherent state techniques are introduced for the exact solution of the isotropic Heisenberg chain with and without quantum boundary fields and Lindblad terms that correspond to two different completely polarized boundary states. We show that this boundary twist leads to non-vanishing stationary currents of all spin components. Our results suggest that the matrix product ansatz can be extended to more general quantum systems kept far from equilibrium by Lindblad boundary terms.
The closed-form solution for the average distance of a deterministic network--Sierpinski network--is found. This important quantity is calculated exactly with the help of recursion relations, which are based on the self-similar network structure and
enable one to derive the precise formula analytically. The obtained rigorous solution confirms our previous numerical result, which shows that the average distance grows logarithmically with the number of network nodes. The result is at variance with that derived from random networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
