Ligações preferenciais em redes complexas: modelo de desafinidade

Abstract

Many systems can be represented by complex networks once that they are characterized by several constituents interacting with each other. Because that, the study of the networks has become very popular in the scientific community, in the different areas of research. Seeking to understand the behavior of some real systems, many models were proposed. In this work, we elaborate and discuss a complex dynamic network model, based on the Bianconi-Barabasi model. We changed the preferential attachment rule by inserting a factor representing a dissimilarity between the sites. The dissimilarity factor informs us about the differences between the fitness parameter (𝜂). In this way, two factors are responsible by the competition for links: (i) connectivity, the most connected sites are favorable to receive more connections, and (ii) dissimilarity, sites with different fitness are more likely to establish connections. We numerically computed, the connectivity distribution of the network 𝑃(𝑘), the connectivity temporal evolution of the sites and others intrinsic properties in the study of networks. An interesting result studied was the degree distribution entropy, which revealed invariant by the network’s size, as expected, however, changes with 𝑚 (number of links at each step of time).