اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMaster-equation analysis of accelerating networks
268
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In many real-world networks, the rates of node and link addition are time dependent. This observation motivates the definition of accelerating networks. There has been relatively little investigation of accelerating networks and previous efforts at analyzing their degree distributions have employed mean-field techniques. By contrast, we show that it is possible to apply a master-equation approach to such network development. We provide full time-dependent expressions for the evolution of the degree distributions for the canonical situations of random and preferential attachment in networks undergoing constant acceleration. These results are in excellent agreement with results obtained from simulations. We note that a growing, non-equilibrium network undergoing constant acceleration with random attachment is equivalent to a classical random graph, bridging the gap between non-equilibrium and classical equilibrium networks.
قيم البحث
اقرأ أيضاً
Network growth as described by the Duplication-Divergence model proposes a simple general idea for the evolution dynamics of natural networks. In particular it is an alternative to the well known Barabasi-Albert model when applied to protein-protein
interaction networks. In this work we derive a master equation for the node degree distribution of networks growing via Duplication and Divergence and we obtain an expression for the total number of links and for the degree distribution as a function of the number of nodes. Using algebra tools we investigate the degree distribution asymptotic behavior. Analytic results show that the network nodes average degree converges if the total mutation rate is greater than 0.5 and diverges otherwise. Treating original and duplicated node mutation rates as independent parameters has no effect on this result. However, difference in these parameters results in a slower rate of convergence and in different degree distributions. The more different these parameters are, the denser the tail of the distribution. We compare the solutions obtained with simulated networks. These results are in good agreement with the expected values from the derived expressions. The method developed is a robust tool to investigate other models for network growing dynamics.
Simple models of infectious diseases tend to assume random mixing of individuals, but real interactions are not random pairwise encounters: they occur within various types of gatherings such as workplaces, households, schools, and concerts, best desc
ribed by a higher-order network structure. We model contagions on higher-order networks using group-based approximate master equations, in which we track all states and interactions within a group of nodes and assume a mean-field coupling between them. Using the Susceptible-Infected-Susceptible dynamics, our approach reveals the existence of a mesoscopic localization regime, where a disease can concentrate and self-sustain only around large groups in the network overall organization. In this regime, the phase transition is smeared, characterized by an inhomogeneous activation of the groups. At the mesoscopic level, we observe that the distribution of infected nodes within groups of a same size can be very dispersed, even bimodal. When considering heterogeneous networks, both at the level of nodes and groups, we characterize analytically the region associated with mesoscopic localization in the structural parameter space. We put in perspective this phenomenon with eigenvector localization and discuss how a focus on higher-order structures is needed to discern the more subtle localization at the mesoscopic level. Finally, we discuss how mesoscopic localization affects the response to structural interventions and how this framework could provide important insights for a broad range of dynamics.
Social networks are not static but rather constantly evolve in time. One of the elements thought to drive the evolution of social network structure is homophily - the need for individuals to connect with others who are similar to them. In this paper,
we study how the spread of a new opinion, idea, or behavior on such a homophily-driven social network is affected by the changing network structure. In particular, using simulations, we study a variant of the Axelrod model on a network with a homophilic rewiring rule imposed. First, we find that the presence of homophilic rewiring within the network, in general, impedes the reaching of consensus in opinion, as the time to reach consensus diverges exponentially with network size $N$. We then investigate whether the introduction of committed individuals who are rigid in their opinion on a particular issue, can speed up the convergence to consensus on that issue. We demonstrate that as committed agents are added, beyond a critical value of the committed fraction, the consensus time growth becomes logarithmic in network size $N$. Furthermore, we show that slight changes in the interaction rule can produce strikingly different results in the scaling behavior of $T_c$. However, the benefit gained by introducing committed agents is qualitatively preserved across all the interaction rules we consider.
The master equation approach is proposed to describe the evolution of passengers in a subway system. With the transition rate constructed from simple geographical consideration, the evolution equation for the distribution of subway passengers is foun
d to bear skew distributions including log-normal, Weibull, and power-law distributions. This approach is then applied to the Metropolitan Seoul Subway system: Analysis of the trip data of all passengers in a day reveals that the data in most cases fit well to the log-normal distributions. Implications of the results are also discussed.
We present a detailed investigation of the behavior of the nonlinear q-voter model for opinion dynamics. At the mean-field level we derive analytically, for any value of the number q of agents involved in the elementary update, the phase diagram, the
exit probability and the consensus time at the transition point. The mean-field formalism is extended to the case that the interaction pattern is given by generic heterogeneous networks. We finally discuss the case of random regular networks and compare analytical results with simulations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
