نبذة مختصرة : In this work we study a connection between a non-Gaussian statistics, the Kaniadakis statistics, and Complex Networks. We show that the degree distribution P(k)of a scale free-network, can be calculated using a maximization of information entropy in the context of non-gaussian statistics. As an example, a numerical analysis based on the preferential attachment growth model is discussed, as well as a numerical behavior of the Kaniadakis and Tsallis degree distribution is compared. We also analyze the diffusive epidemic process (DEP) on a regular lattice one-dimensional. The model is composed of A (healthy) and B (sick) species that independently diffusive on lattice with diffusion rates DA and DB for which the probabilistic dynamical rule A + B → 2B and B → A. This model belongs to the category of non-equilibrium systems with an absorbing state and a phase transition between active an inactive states. We investigate the critical behavior of the DEP using an auto-adaptive algorithm to find critical points: the method of automatic searching for critical points (MASCP). We compare our results with the literature and we find that the MASCP successfully finds the critical exponents 1/ѵ and 1/zѵ in all the cases DA =DB, DA DB. The simulations show that the DEP has the same critical exponents as are expected from field-theoretical arguments. Moreover, we find that, contrary to a renormalization group prediction, the system does not show a discontinuous phase transition in the regime o DA >DB. ; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior ; Neste trabalho, estudamos a conexão entre uma estatística não Gaussiana, a estatística de Kaniadakis, e as redes complexas. Nós mostramos que a distribuição de conectividades P(k), de uma rede livre de escala, pode ser determinada usando a maximização da entropia de informação no contexto de estatísticas não Gaussianas. Como exemplo, discutimos uma análise numérica baseada no modelo de crescimento com ligação preferencial e comparamos o ...
No Comments.