اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCompetitive Dynamics on Complex Networks
109
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is much more likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.
قيم البحث
اقرأ أيضاً
Based on signaling process on complex networks, a method for identification community structure is proposed. For a network with $n$ nodes, every node is assumed to be a system which can send, receive, and record signals. Each node is taken as the ini
tial signal source once to inspire the whole network by exciting its neighbors and then the source node is endowed a $n$d vector which recording the effects of signaling process. So by this process, the topological relationship of nodes on networks could be transferred into the geometrical structure of vectors in $n$d Euclidian space. Then the best partition of groups is determined by $F$-statistic and the final community structure is given by Fuzzy $C$-means clustering method (FCM). This method can detect community structure both in unweighted and weighted networks without any extra parameters. It has been applied to ad hoc networks and some real networks including Zachary Karate Club network and football team network. The results are compared with that of other approaches and the evidence indicates that the algorithm based on signaling process is effective.
Spatially embedded networks have attracted increasing attention in the last decade. In this context, new types of network characteristics have been introduced which explicitly take spatial information into account. Among others, edge directionality p
roperties have recently gained particular interest. In this work, we investigate the applicability of mean edge direction, anisotropy and local mean angle as geometric characteristics in complex spherical networks. By studying these measures, both analytically and numerically, we demonstrate the existence of a systematic bias in spatial networks where individual nodes represent different shares on a spherical surface, and describe a strategy for correcting for this effect. Moreover, we illustrate the application of the mentioned edge directionality properties to different examples of real-world spatial networks in spherical geometry (with or without the geometric correction depending on each specific case), including functional climate networks, transportation and trade networks. In climate networks, our approach highlights relevant patterns like large-scale circulation cells, the El Ni~{n}o--Southern Oscillation and the Atlantic Ni~{n}o. In an air transportation network, we are able to characterize distinct air transportation zones, while we confirm the important role of the European Union for the global economy by identifying convergent edge directionality patterns in the world trade network.
A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the nodes neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks, weights were eith
er ignored or thresholded in order to retain or disregard an edge. Therefore, despite its popularity, the degree measure fails to capture the disparity of interaction between a node and its neighbors. We introduce in this paper a generalization of the degree measure that addresses this limitation: the continuous node degree (C-degree). The C-degree of a node reflects how many neighbors are effectively being used, taking interaction disparity into account. More importantly, if a node interacts uniformly with its neighbors (no interaction disparity), we prove that the C-degree of the node becomes identical to the nodes (discrete) degree. We analyze four real-world weighted networks using the new measure and show that the C-degree distribution follows the power-law, similar to the traditional degree distribution, but with steeper decline. We also show that the ratio between the C-degree and the (discrete) degree follows a pattern that is common in the four studied networks.
We study the self-organization of the consonant inventories through a complex network approach. We observe that the distribution of occurrence as well as cooccurrence of the consonants across languages follow a power-law behavior. The co-occurrence n
etwork of consonants exhibits a high clustering coefficient. We propose four novel synthesis models for these networks (each of which is a refinement of the earlier) so as to successively match with higher accuracy (a) the above mentioned topological properties as well as (b) the linguistic property of feature economy exhibited by the consonant inventories. We conclude by arguing that a possible interpretation of this mechanism of network growth is the process of child language acquisition. Such models essentially increase our understanding of the structure of languages that is influenced by their evolutionary dynamics and this, in turn, can be extremely useful for building future NLP applications.
Sun et al. provided an insightful comment arXiv:1108.5739v1 on our manuscript entitled Controllability of Complex Networks with Nonlinear Dynamics on arXiv. We agree on their main point that linearization about locally desired states can be violated
in general by the breakdown of local control of the linearized complex network with nonlinear state. Therefore, we withdraw our manuscript. However, other than nonlinear dynamics, our claim that a single-node-control can fully control the general bidirectional/undirected linear network with 1D self-dynamics is still valid, which is similar to (but different from) the conclusion of arXiv:1106.2573v3 that all-node-control with a single signal can fully control any direct linear network with nodal-dynamics (1D self-dynamics).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
