اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSteady-State Dynamics of the Forest Fire Model on Complex Networks
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many sociological networks, as well as biological and technological ones, can be represented in terms of complex networks with a heterogeneous connectivity pattern. Dynamical processes taking place on top of them can be very much influenced by this topological fact. In this paper we consider a paradigmatic model of non-equilibrium dynamics, namely the forest fire model, whose relevance lies in its capacity to represent several epidemic processes in a general parametrization. We study the behavior of this model in complex networks by developing the corresponding heterogeneous mean-field theory and solving it in its steady state. We provide exact and approximate expressions for homogeneous networks and several instances of heterogeneous networks. A comparison of our analytical results with extensive numerical simulations allows to draw the region of the parameter space in which heterogeneous mean-field theory provides an accurate description of the dynamics, and enlights the limits of validity of the mean-field theory in situations where dynamical correlations become important.
قيم البحث
اقرأ أيضاً
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.
The majority-vote (MV) model is one of the simplest nonequilibrium Ising-like model that exhibits a continuous order-disorder phase transition at a critical noise. In this paper, we present a quenched mean-field theory for the dynamics of the MV mode
l on networks. We analytically derive the critical noise on arbitrary quenched unweighted networks, which is determined by the largest eigenvalue of a modified network adjacency matrix. By performing extensive Monte Carlo simulations on synthetic and real networks, we find that the performance of the quenched mean-field theory is superior to a heterogeneous mean-field theory proposed in a previous paper [Chen emph{et al.}, Phys. Rev. E 91, 022816 (2015)], especially for directed networks.
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the percolati
ng cluster. Here we study this inducing effect on the classical site percolation and K-core percolation, showing that the inducing effect always causes a discontinuous percolation transition. We precisely predict the percolation threshold and core size for uncorrelated random networks with arbitrary degree distributions. For low-dimensional lattices the percolation threshold fluctuates considerably over realizations, yet we can still predict the core size once the percolation occurs. The core sizes of real-world networks can also be well predicted using degree distribution as the only input. Our work therefore provides a theoretical framework for quantitatively understanding discontinuous breakdown phenomena in various complex systems.
In this paper we analyze the effect of a non-trivial topology on the dynamics of the so-called Naming Game, a recently introduced model which addresses the issue of how shared conventions emerge spontaneously in a population of agents. We consider in
particular the small-world topology and study the convergence towards the global agreement as a function of the population size $N$ as well as of the parameter $p$ which sets the rate of rewiring leading to the small-world network. As long as $p gg 1/N$ there exists a crossover time scaling as $N/p^2$ which separates an early one-dimensional-like dynamics from a late stage mean-field-like behavior. At the beginning of the process, the local quasi one-dimensional topology induces a coarsening dynamics which allows for a minimization of the cognitive effort (memory) required to the agents. In the late stages, on the other hand, the mean-field like topology leads to a speed up of the convergence process with respect to the one-dimensional case.
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting nodes. Us
ing a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean-field first-passage time between arbitrary two nodes. All the results are relevant to the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block models, and Barabasi-Albert scale-free networks, and find the advantage of the resetting processes to multiple resetting nodes in global searching on such networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
