اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCompetition ability dependence on uniqueness in some collaboration-competition bipartite networks
143
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recently, our group quantitatively defined two quantities, competition ability and uniqueness (Chin. Phys. Lett. 26 (2009) 058901) for a kind of cooperation-competition bipartite networks, where producers produce some products and output them to a market to make competition. Factories, universities or restaurants can serve as the examples. In the letter we presented an analytical conclusion that the competition ability was linearly dependent on the uniqueness in the trivial cases, where both the input quality and competition gain obey normal distributions. The competition between Chinese regional universities was taken as examples. In this article we discuss the abnormal cases where competition gains show the distributions near to power laws. In addition, we extend the study onto all the cooperation-competition bipartite networks and therefore redefine the competition ability. The empirical investigation of the competition ability dependence on the uniqueness in 15 real world collaboration-competition systems is presented, 14 of which belong to the general nontrivial cases. We find that the dependence generally follows the so-called shifted power law (SPL), but very near to power laws. The empirically obtained heterogeneity indexes of the distributions of competition ability and uniqueness are also presented. These empirical investigations will be used as a supplementary of a future paper, which will present the comparison and further discussions about the competition ability dependence on the uniqueness in the abnormal collaboration-competition systems and the relationship between the dependence and the competition ability and uniqueness heterogeneity.
قيم البحث
اقرأ أيضاً
Recently, we introduced a quantity, node weight, to describe the collaboration sharing or competition gain of the elements in the collaboration-competition networks, which can be well described by bipartite graphs. We find that the node weight distri
butions of all the networks follow the so-called shifted power law (SPL). The common distribution function may indicate that the evolution of the collaboration and competition in very different systems obeys a general rule. In order to set up a base of the further investigations on the universal system evolution dynamics, we now present the definition of the networks and their node weights, the node weight distributions, as well as the evolution durations of 15 real world collaboration-competition systems which are belonging to diverse fields.
Competition and collaboration are at the heart of multi-agent probabilistic spreading processes. The battle on public opinion and competitive marketing campaigns are typical examples of the former, while the joint spread of multiple diseases such as
HIV and tuberculosis demonstrates the latter. These spreads are influenced by the underlying network topology, the infection rates between network constituents, recovery rates and, equally importantly, the interactions between the spreading processes themselves. Here, for the first time we derive dynamic message-passing equations that provide an exact description of the dynamics of two interacting spreading processes on tree graphs, and develop systematic low-complexity models that predict the spread on general graphs. We also develop a theoretical framework for an optimal control of interacting spreading processes through an optimized resource allocation under budget constraints and within a finite time window. Derived algorithms can be used to maximize the desired spread in the presence of a rival competitive process, and to limit the spread through vaccination in the case of coupled infectious diseases. We demonstrate the efficacy of the framework and optimization method on both synthetic and real-world networks.
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise. It can be applied to many real-world scenarios and explain many social phenomena. In this article, we study the effect of competition on bipartite m
atching problem by introducing correlated wish list. The results show that proper competition can improve the overall happiness of society and also reduce the instability of the matching result of unequal sized bipartite matching.
The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level,
we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.
Mutualistic networks have attracted increasing attention in the ecological literature in the last decades as they play a key role in the maintenance of biodiversity. Here, we develop an analytical framework to study the structural stability of these
networks including both mutualistic and competitive interactions. Analytical and numerical analyses show that the structure of the competitive network fundamentally alters the necessary conditions for species coexistence in communities. Using 50 real mutualistic networks, we show that when the relative importance of shared partners is incorporated via weighted competition, the feasibility area in the parameter space is highly correlated with Mays stability criteria and can be predicted by a functional relationship between the number of species, the network connectance and the average interaction strength in the community. Our work reopens a decade-long debate about the complexity-stability relationship in ecological communities, and highlights the role of the relative structures of different interaction types.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
