اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMutual Support in Agent Networks
58
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We construct a model of social behaviour through the dynamics of interacting agents. The agents undergo game-theoretic interactions where each agent can decide to lend support to particular other agents or otherwise, and agents are rewarded according to total support received. We analyse and carry out Monte Carlo simulations of such systems to uncover their evolutionary dynamics, and to explore their phase structure.
قيم البحث
اقرأ أيضاً
Though many aggregation theories exist for physical, chemical and biological systems, they do not account for the significant heterogeneity found, for example, in populations of living objects. This is unfortunate since understanding how heterogeneou
s individuals come together in support of an extremist cause, for example, represents an urgent societal problem. Here we develop such a theory and show that the intrinsic population heterogeneity can significantly delay the gel transition point and change the gels growth rate. We apply our theory to examine how humans aggregate online in support of a particular extremist cause. We show that the theory provides an accurate description of the online extremist support for ISIS (so-called Islamic State) which started in late 2014.
Many real-world networks exhibit a high degeneracy at few eigenvalues. We show that a simple transformation of the networks adjacency matrix provides an understanding of the origins of occurrence of high multiplicities in the networks spectra. We fin
d that the eigenvectors associated with the degenerate eigenvalues shed light on the structures contributing to the degeneracy. Since these degeneracies are rarely observed in model graphs, we present results for various cancer networks. This approach gives an opportunity to search for structures contributing to degeneracy which might have an important role in a network.
Many real-world complex systems are best modeled by multiplex networks. The multiplexity has proved to have broad impact on the systems structure and function. Most theoretical studies on multiplex networks to date, however, have largely ignored the
effect of link overlap across layers despite strong empirical evidences for its significance. In this article, we investigate the effect of link overlap in the viability of multiplex networks, both analytically and numerically. Distinctive role of overlapping links in viability and mutual connectivity is emphasized and exploited for setting up proper analytic framework. A rich phase diagram for viability is obtained and greatly diversified patterns of hysteretic behavior in viability are observed in the presence of link overlap. Mutual percolation with link overlap is revisited as a limit of multiplex viability problem, and controversy between existing results is clarified. The distinctive role of overlapping links is further demonstrated by the different responses of networks under random removals of overlapping and non-overlapping links, respectively, as well as under several removal strategies. Our results show that the link overlap strongly facilitates viability and mutual percolation; at the same time, the presence of link overlap poses challenge in analytical approach to the problem.
Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes based on thei
r topological importance within a graph. Here we review and compare centrality measures based on spectral properties of graph matrices. We shall focus on PageRank, eigenvector centrality and the hub/authority scores of HITS. We derive simple relations between the measures and the (in)degree of the nodes, in some limits. We also compare the rankings obtained with different centrality measures.
An imperative condition for the functioning of a power-grid network is that its power generators remain synchronized. Disturbances can prompt desynchronization, which is a process that has been involved in large power outages. Here we derive a condit
ion under which the desired synchronous state of a power grid is stable, and use this condition to identify tunable parameters of the generators that are determinants of spontaneous synchronization. Our analysis gives rise to an approach to specify parameter assignments that can enhance synchronization of any given network, which we demonstrate for a selection of both test systems and real power grids. Because our results concern spontaneous synchronization, they are relevant both for reducing dependence on conventional control devices, thus offering an additional layer of protection given that most power outages involve equipment or operational errors, and for contributing to the development of smart grids that can recover from failures in real time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
