We address this work to investigate symbolic sequences with long-range correlations by using computational simulation. We analyze sequences with two, three and four symbols that could be repeated l times, with the probability distribution p(l) ∝ 1/lμ. For these sequences, we verified that the usual entropy increases more slowly when the symbols are correlated and the Tsallis entropy exhibits, f...

We show that there is an effect of nonextensivity acting upon the BCS model for superconductors in the ground state that motivates its study in the Tsallis’ statistical framework. We show that the weak-coupling limit superconductors are well described by q ∼ 1, where q is a real parameter which characterizes the degree of nonextensivity of the Tsallis’ entropy. Nevertheless, small deviations wi...

In 1982, Tsallis derived a formula which proposed an exact value of 0.522372078 . . . for the bond percolation threshold of the kagome lattice. We use the substitution method, which is based on stochastic ordering, to compare the probability distribution of connections in the homogeneous bond percolation model on the kagome lattice to those of an exactly-solved inhomogeneous bond percolation mo...

We have discussed dynamical properties of the Tsallis entropy and the generalized Fisher information in nonextensive systems described by the Langevin model subjected to additive and multiplicative noise. Analytical expressions for the timedependent Tsallis entropy and generalized Fisher information have been obtained with the use of the q-moment approach to the Fokker-Planck equation developed...

In this work, we develop a multilevel edge detection method based on the Kapur and Tsallis entropies. The multilevel thresholding approach gives rise to an NP-hard optimization problem. We have used the Classical Genetic Algorithm (CGA) and the Quantum Genetic Algorithm (QGA) to solve this problem. The performance of the QGA has been tested on ten sample images and it is shown that the QGA outp...

Quite general, analytical (both exact and approximate) forms for discrete probability distributions (PD’s) that maximize Tsallis entropy for a fixed variance are here investigated. They apply, for instance, in a wide variety of scenarios in which the system is characterized by a series of discrete eigenstates of the Hamiltonian. Using these discrete PD’s as “weights” leads to density operators ...

In this paper we consider the Monte Carlo simulated annealings based on the Tsallis and threshold acceptance probabilities. This is done by applying them to the 2D system of many particles both interacting among themselves by a dipole–dipole potential and affected by the gravitational force. Our results confirm that for large and negative values of the Tsallis parameter q, the generalized metho...