ترغب بنشر مسار تعليمي؟ اضغط هنا

Bidirectional selection between two classes in complex social networks

146   0   0.0 ( 0 )
 نشر من قبل Bin Zhou
 تاريخ النشر 2015
والبحث باللغة English




اسأل ChatGPT حول البحث

The bidirectional selection between two classes widely emerges in various social lives, such as commercial trading and mate choosing. Until now, the discussions on bidirectional selection in structured human society are quite limited. We demonstrated theoretically that the rate of successfully matching is affected greatly by individuals neighborhoods in social networks, regardless of the type of networks. Furthermore, it is found that the high average degree of networks contributes to increasing rates of successful matches. The matching performance in different types of networks has been quantitatively investigated, revealing that the small-world networks reinforces the matching rate more than scale-free networks at given average degree. In addition, our analysis is consistent with the modeling result, which provides the theoretical understanding of underlying mechanisms of matching in complex networks.



قيم البحث

اقرأ أيضاً

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.
A model algorithm is proposed to study subsequent partitions of complex networks describing social structures. The partitions are supposed to appear as actions of rivaling leaders corresponding to nodes with large degrees. The condition of a partitio n is that the distance between two leaders is at least three links. This ensures that the layer of nearest neighbours of each leader remains attached to him. As a rule, numerically calculated size distribution of fragments of scale-free Albert-Barabasi networks reveals one large fragment which contains the original leader (hub of the network), and a number of small fragments with opponents that are described by two Weibull distributions. Numerical simulations and mean-field theory reveal that size of the larger fragment scales as the square root of the initial network size. The algorithm is applied to the data on political blogs in U.S. (L. Adamic and N. Glance, Proc. WWW-2005). The obtained fragments are clearly polarized; either they belong to Democrats, or to the GOP.
The organisation of a network in a maximal set of nodes having at least $k$ neighbours within the set, known as $k$-core decomposition, has been used for studying various phenomena. It has been shown that nodes in the innermost $k$-shells play a cruc ial role in contagion processes, emergence of consensus, and resilience of the system. It is known that the $k$-core decomposition of many empirical networks cannot be explained by the degree of each node alone, or equivalently, random graph models that preserve the degree of each node (i.e., configuration model). Here we study the $k$-core decomposition of some empirical networks as well as that of some randomised counterparts, and examine the extent to which the $k$-shell structure of the networks can be accounted for by the community structure. We find that preserving the community structure in the randomisation process is crucial for generating networks whose $k$-core decomposition is close to the empirical one. We also highlight the existence, in some networks, of a concentration of the nodes in the innermost $k$-shells into a small number of communities.
Vaccination and outbreak monitoring are essential tools for preventing and minimizing outbreaks of infectious diseases. Targeted strategies, where the individuals most important for monitoring or preventing outbreaks are selected for intervention, of fer a possibility to significantly improve these measures. Although targeted strategies carry a strong potential, identifying optimal target groups remains a challenge. Here we consider the problem of identifying target groups based on digital communication networks (telecommunication, online social media) in order to predict and contain an infectious disease spreading on a real-world person-to-person network of more than 500 individuals. We show that target groups for efficient outbreak monitoring can be determined based on both telecommunication and online social network information. In case of vaccination the information regarding the digital communication networks improves the efficacy for short-range disease transmissions but, surprisingly, performance is severely reduced in the case of long-range transmission. These results are robust with respect to the strategy used to identify targeted individuals and time-gap between identification of targets and the intervention. Thus, we demonstrate that data available from telecommunication and online social networks can greatly improve epidemic control measures, but it is important to consider the details of the pathogen spreading mechanism when such policies are applied.
Social network is a main tunnel of rumor spreading. Previous studies are concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its spreading proces s, which grows shorter, more concise, more easily grasped and told. In an early psychological experiment, researchers found about 70% of details in a rumor were lost in the first 6 mouth-to-mouth transmissions cite{TPR}. Based on the facts, we investigate rumor spreading on social networks, where the content of the rumor is modified by the individuals with a certain probability. In the scenario, they have two choices, to forward or to modify. As a forwarder, an individual disseminates the rumor directly to its neighbors. As a modifier, conversely, an individual revises the rumor before spreading it out. When the rumor spreads on the social networks, for instance, scale-free networks and small-world networks, the majority of individuals actually are infected by the multi-revised version of the rumor, if the modifiers dominate the networks. Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn to be a rumor as well. Our result suggests the rumor evolution should not be a negligible question, which may provide a better understanding of the generation and destruction of a rumor.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا