اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConsensus formation on a triad scale-free network
221
0
0.0
(
0
)
تأليف
A.O. Sousa
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Several cases of the Sznajd model of socio-physics, that only a group of people sharing the same opinion can convince their neighbors, have been simulated on a more realistic network with a stronger clustering. In addition, many opinions, instead of usually only two, and a convincing probability have been also considered. Finally, with minor changes we obtain a vote distribution in good agreement with reality.
قيم البحث
اقرأ أيضاً
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in non-fractal netwo
rks. To this end, we examine a simple random walk with a fixed trap at a given position on a fractal scale-free network. We calculate analytically the mean first-passage time (MFPT) as a measure of the efficiency for the trapping process, and obtain a closed-form expression for MFPT, which agrees with direct numerical calculations. We find that, in the limit of a large network order $V$, the MFPT $<T>$ behaves superlinearly as $<T > sim V^{{3/2}}$ with an exponent 3/2 much larger than 1, which is in sharp contrast to the scaling $<T > sim V^{theta}$ with $theta leq 1$, previously obtained for non-fractal scale-free networks. Our results indicate that the degree distribution of scale-free networks is not sufficient to characterize trapping processes taking place on them. Since various real-world networks are simultaneously scale-free and fractal, our results may shed light on the understanding of trapping processes running on real-life systems.
A Bounded Confidence (BC) model of socio-physics, in which the agents have continuous opinions and can influence each other only if the distance between their opinions is below a threshold, is simulated on a still growing scale-free network consideri
ng several different strategies: for each new node (or vertex), that is added to the network all individuals of the network have their opinions updated following a BC model recipe. The results obtained are compared with the original model, with numerical simulations on different graph structures and also when it is considered on the usual fixed BA network. In particular, the comparison with the latter leads us to conclude that it does not matter much whether the network is still growing or is fixed during the opinion dynamics.
We show that the collapsed globular phase of a polymer accommodates a scale-free incompatibility graph of its contacts. The degree distribution of this network is found to decay with the exponent $gamma = 1/(2-c)$ up to a cut-off degree $d_c propto L
^{2-c}$, where $c$ is the loop exponent for dense polymers ($c=11/8$ in two dimensions) and $L$ is the length of the polymer. Our results exemplify how a scale-free network (SFN) can emerge from standard criticality.
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type
. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with probability proportional to (kq)^(-alpha), where alpha is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a network in wh
ich the probability for an edge between nodes $i$ and $j$ to be retained is proportional to $(k_ik_j)^{-alpha}$ with $k_i$ and $k_j$ the degrees of the nodes. We discuss two methods of network reconstruction, sequential and simultaneous, and investigate their properties by analytical and numerical means. The system is examined away from the percolation transition, where the size of the giant cluster is obtained, and close to the transition, where nonuniversal critical exponents are extracted using the generating functions method. The theory is found to agree quite well with simulations. By introducing an extension of the Fortuin-Kasteleyn construction, we find that biased percolation is well described by the $qto 1$ limit of the $q$-state Potts model with inhomogeneous couplings.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
