RESUMO
We present a study of the dynamic interactions between actors located on complex networks with scale-free and hierarchical scale-free topologies with assortative mixing, that is, correlations between the degree distributions of the actors. The actor's state evolves according to a model that considers its previous state, the inertia to change, and the influence of its neighborhood. We show that the time evolution of the system depends on the percentage of cooperative or competitive interactions. For scale-free networks, we find that the dispersion between actors is higher when all interactions are either cooperative or competitive, while a balanced presence of interactions leads to a lower separation. Moreover, positive assortative mixing leads to greater divergence between the states, while negative assortative mixing reduces this dispersion. We also find that hierarchical scale-free networks have both similarities and differences when compared with scale-free networks. Hierarchical scale-free networks, like scale-free networks, show the least divergence for an equal mix of cooperative and competitive interactions between actors. On the other hand, hierarchical scale-free networks, unlike scale-free networks, show much greater divergence when dominated by cooperative rather than competitive actors, and while the formation of a rich club (adding links between hubs) with cooperative interactions leads to greater divergence, the divergence is much less when they are fully competitive. Our findings highlight the importance of the topology where the interaction dynamics take place, and the fact that a balanced presence of cooperators and competitors makes the system more cohesive, compared to the case where one strategy dominates.
RESUMO
Network models for disease transmission and dynamics are popular because they are among the simplest agent-based models. Highly heterogeneous populations (in the number of contacts) may be modeled by networks with long-tailed degree distributions for which the variance is much greater than the mean degree. An example is given by scale-free networks where the degree distribution follows a power law. In these type of networks there is not a typical degree. Some nodes may have low representation in the population but are key to drive disease transmission. Coarse graining may be used to simplify these complex networks. In this work we present a simple model consisting in of a network where nodes have only two possible degrees, a low degree close to the mean degree and a high degree about ten times the mean degree. We show that in spite of this extreme simplification, main features of disease dynamics in scale-free networks are well captured by our model.
Assuntos
Epidemias , Modelos BiológicosRESUMO
We focus on macromolecules which are modeled as sequentially growing dual scale-free networks. The dual networks are built by replacing star-like units of the primal treelike scale-free networks through rings, which are then transformed in a small-world manner up to the complete graphs. In this respect, the parameter γ describing the degree distribution in the primal treelike scale-free networks regulates the size of the dual units. The transition towards the networks of complete graphs is controlled by the probability p of adding a link between non-neighboring nodes of the same initial ring. The relaxation dynamics of the polymer networks is studied in the framework of generalized Gaussian structures by using the full eigenvalue spectrum of the Laplacian matrix. The dynamical quantities on which we focus here are the averaged monomer displacement and the mechanical relaxation moduli. For several intermediate values of the parameters' set ( γ , p ) , we encounter for these dynamical properties regions of constant in-between slope.