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

A veritable zoology of successive phase transitions in the asymmetric $q$-voter model on multiplex networks

104   0   0.0 ( 0 )
 نشر من قبل Julian Sienkiewicz
 تاريخ النشر 2020
  مجال البحث فيزياء
والبحث باللغة English




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

We analyze a nonlinear $q$-voter model with stochastic noise, interpreted in the social context as independence, on a duplex network. The size of the lobby $q$ (i.e., the pressure group) is a crucial parameter that changes the behavior of the system. The $q$-voter model has been applied on multiplex networks in a previous work [Phys. Rev E. 92. 052812. (2015)], and it has been shown that the character of the phase transition depends on the number of levels in the multiplex network as well as the value of $q$. Here we study phase transition character in the case when on each level of the network the lobby size is different, resulting in two parameters $q_1$ and $q_2$. We find evidence of successive phase transitions when a continuous phase transition is followed by a discontinuous one or two consecutive discontinuous phases appear, depending on the parameter. When analyzing this system, we even encounter mixed-order (or hybrid) phase transition. We perform simulations and obtain supporting analytical solutions on a simple multiplex case - a duplex clique, which consists of two fully overlapped complete graphs (cliques).



قيم البحث

اقرأ أيضاً

We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it difficult to di sentangle the effects of the stochastic process itself relative to the network structure. We introduce a process with two steps, one that selects a pair of interacting nodes and one that determines the direction of interaction as a function of the degrees of the two nodes and a parameter $alpha$ which sets the likelihood of the higher degree node giving its state. Traditional voter model behavior can be recovered within the model. We find that on a complete bipartite network, the traditional voter model is the fastest process. On a random network with power law degree distribution, we observe two regimes. For modest values of $alpha$, exit time is dominated by diffusive drift of the system state, but as the high nodes become more influential, the exit time becomes becomes dominated by frustration effects. For certain selection processes, a short intermediate regime occurs where exit occurs after exponential mixing.
119 - R. A. Blythe 2010
We study the voter model and related random-copying processes on arbitrarily complex network structures. Through a representation of the dynamics as a particle reaction process, we show that a quantity measuring the degree of order in a finite system is, under certain conditions, exactly governed by a universal diffusion equation. Whenever this reduction occurs, the details of the network structure and random-copying process affect only a single parameter in the diffusion equation. The validity of the reduction can be established with considerably less information than one might expect: it suffices to know just two characteristic timescales within the dynamics of a single pair of reacting particles. We develop methods to identify these timescales, and apply them to deterministic and random network structures. We focus in particular on how the ordering time is affected by degree correlations, since such effects are hard to access by existing theoretical approaches.
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described by the top ology of a network. We consider the q-state Potts model on an uncorrelated scale-free network for which the node-degree distribution manifests a power-law decay governed by the exponent lambda. We work within the mean-field approximation, since for systems on random uncorrelated scale-free networks this method is known to often give asymptotically exact results. Depending on particular values of q and lambda one observes either a first-order or a second-order phase transition or the system is ordered at any finite temperature. In a case study, we consider the limit q=1 (percolation) and find a correspondence between the magnetic exponents and those describing percolation on a scale-free network. Interestingly, logarithmic corrections to scaling appear at lambda=4 in this case.
We study the phase transition of the Ising model in networks with core-periphery structures. By Monte Carlo simulations, we show that prior to the order-disorder phase transition the system organizes into an inhomogeneous intermediate phase in which core nodes are much more ordered than peripheral nodes. Interestingly, the susceptibility shows double peaks at two distinct temperatures. We find that, if the connections between core and periphery increase linearly with network size, the first peak does not exhibit any size-dependent effect, and the second one diverges in the limit of infinite network size. Otherwise, if the connections between core and periphery scale sub-linearly with the network size, both peaks of the susceptibility diverge as power laws in the thermodynamic limit. This suggests the appearance of a double transition phenomenon in the Ising model for the latter case. Moreover, we develop a mean-field theory that agrees well with the simulations.
394 - Menghui Li , Ying Fan , Jinshan Wu 2013
In order to investigate the role of the weight in weighted networks, the collective behavior of the Ising system on weighted regular networks is studied by numerical simulation. In our model, the coupling strength between spins is inversely proportio nal to the corresponding weighted shortest distance. Disordering link weights can effectively affect the process of phase transition even though the underlying binary topological structure remains unchanged. Specifically, based on regular networks with homogeneous weights initially, randomly disordering link weights will change the critical temperature of phase transition. The results suggest that the redistribution of link weights may provide an additional approach to optimize the dynamical behaviors of the system.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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