اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStrategy of Competition between Two Groups based on a Contrarian Opinion Model
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a contrarian opinion (CO) model in which a fraction p of contrarians within a group holds a strong opinion opposite to the opinion held by the rest of the group. At the initial stage, stable clusters of two opinions, A and B exist. Then we introduce contrarians which hold a strong B opinion into the opinion A group. Through their interactions, the contrarians are able to decrease the size of the largest A opinion cluster, and even destroy it. We see this kind of method in operation, e.g when companies send free new products to potential customers in order to convince them to adopt the product and influence others. We study the CO model, using two different strategies, on both ER and scale-free networks. In strategy I, the contrarians are positioned at random. In strategy II, the contrarians are chosen to be the highest degrees nodes. We find that for both strategies the size of the largest A cluster decreases to zero as p increases as in a phase transition. At a critical threshold value p_c the system undergoes a second-order phase transition that belongs to the same universality class of mean field percolation. We find that even for an ER type model, where the degrees of the nodes are not so distinct, strategy II is significantly more effctive in reducing the size of the largest A opinion cluster and, at very small values of p, the largest A opinion cluster is destroyed.
قيم البحث
اقرأ أيضاً
Recent studies have shown that a system composed from several randomly interdependent networks is extremely vulnerable to random failure. However, real interdependent networks are usually not randomly interdependent, rather a pair of dependent nodes
are coupled according to some regularity which we coin inter-similarity. For example, we study a system composed from an interdependent world wide port network and a world wide airport network and show that well connected ports tend to couple with well connected airports. We introduce two quantities for measuring the level of inter-similarity between networks (i) Inter degree-degree correlation (IDDC) (ii) Inter-clustering coefficient (ICC). We then show both by simulation models and by analyzing the port-airport system that as the networks become more inter-similar the system becomes significantly more robust to random failure.
A theory of additive Markov chains with long-range memory is used for description of correlation properties of coarse-grained literary texts. The complex structure of the correlations in texts is revealed. Antipersistent correlations at small distanc
es, L < 300, and persistent ones at L > 300 define this nontrivial structure. For some concrete examples of literary texts, the memory functions are obtained and their power-law behavior at long distances is disclosed. This property is shown to be a cause of self-similarity of texts with respect to the decimation procedure.
Recent empirical observations suggest a heterogeneous nature of human activities. The heavy-tailed inter-event time distribution at population level is well accepted, while whether the individual acts in a heterogeneous way is still under debate. Mot
ivated by the impact of temporal heterogeneity of human activities on epidemic spreading, this paper studies the susceptible-infected model on a fully mixed population, where each individual acts in a completely homogeneous way but different individuals have different mean activities. Extensive simulations show that the heterogeneity of activities at population level remarkably affects the speed of spreading, even though each individual behaves regularly. Further more, the spreading speed of this model is more sensitive to the change of system heterogeneity compared with the model consisted of individuals acting with heavy-tailed inter-event time distribution. This work refines our understanding of the impact of heterogeneous human activities on epidemic spreading.
In J. Shao et al., PRL 103, 108701 (2009) the authors claim that a model with majority rule coarsening exhibits in d=2 a percolation transition in the universality class of invasion percolation with trapping. In the present comment we give compelling
evidence, including high statistics simulations on much larger lattices, that this is not correct. and that the model is trivially in the ordinary percolation universality class.
We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of modeling context
s, especially when coarse-graining the detailed graph information is of interest. One of the main challenges in mining graph data is the definition of a suitable pairwise similarity metric in the space of graphs. We explore two practical solutions to solving this problem: one based on finding subgraph densities, and one using spectral information. The approach is illustrated on three test data sets (ensembles of graphs); two of these are obtained from standard graph generating algorithms, while the graphs in the third example are sampled as dynamic snapshots from an evolving network simulation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
