Related papers: Nonextensive analysis on the local structure entro…
The structure entropy is one of the most important parameters to describe the structure property of the complex networks. Most of the existing struc- ture entropies are based on the degree or the betweenness centrality. In order to describe…
Identifying influential nodes in the complex networks is of theoretical and practical significance. There are many methods are proposed to identify the influential nodes in the complex networks. In this paper, a local structure entropy…
How complex of the complex networks has attracted many researchers to explore it. The entropy is an useful method to describe the degree of the $complex$ of the complex networks. In this paper, a new method which is based on the Tsallis…
Based on the form invariance of the structures given by Khinchin's axiomatic foundations of information theory and the pseudoadditivity of the Tsallis entropy indexed by q, the concept of conditional entropy is generalized to the case of…
We propose a new way of defining entropy of a system, which gives a general form which may be nonextensive as Tsallis entropy, but is linearly dependent on component entropies, like Renyi entropy, which is extensive. This entropy has a…
The form invariance of the statement of the maximum entropy principle and the metric structure in quantum density matrix theory, when generalized to nonextensive situations, is shown here to determine the structure of the nonextensive…
A new method is proposed for analyzing complexity and studying the information in random geometric networks using Tsallis entropy tool. Tsallis entropy of the ensemble of random geometric networks is calculated based on the components of…
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the…
By writing total Tsallis entropy as a function of non-extensivity q-parameter withing the fragment-asperity model for earthquakes, a critical range of values is identified: 1.4 <q< 1.8. It comes directly from constructing the non-extensive…
Tsallis' non-extensive entropy $S_q$ enables us to treat both a power and exponential evolutions of underlying microscopic dynamics on equal footing by adjusting the variable entropic index $q$ to proper one $q^*$. We propose an alternative…
A two-parameter family of statistical measures of complexity are introduced based on the Tsallis-type nonadditive entropies. This provides a unified framework for the study of the recently proposed various measures of complexity as well as…
The nonextensive statistics based on Tsallis entropy have been so far used for the systems composed of subsystems having same $q$. The applicability of this statistics to the systems with different $q$'s is still a matter of investigation.…
Nonextensivity is foreseeable in network ensembles, as heterogeneous interactions generally exist in complex networked systems that need to be described by network ensembles. But this nonextensivity has not been literatured proved yet. In…
The structure entropy is an important index to illuminate the structure property of the complex network. Most of the existing structure entropies are based on the degree distribution of the complex network. But the structure entropy based…
In this paper we give an interpretation of Tsallis' nonextensive statistical mechanics based upon the information-theoretic point of view of Luzzi et al. [cond-mat/0306217; cond-mat/0306247; cond-mat/0307325], suggesting Tsallis' entropy to…
Entropy and relative or cross entropy measures are two very fundamental concepts in information theory and are also widely used for statistical inference across disciplines. The related optimization problems, in particular the maximization…
We define an entropy based on a chosen governing probability distribution. If a certain kind of measurements follow such a distribution it also gives us a suitable scale to study it with. This scale will appear as a link function that is…
A chain rule and a subadditivity for the entropy of type $\beta$, which is one of the nonadditive entropies, were derived by Z.Dar\'oczy. In this paper, we study the further relations among Tsallis type entropies which are typical…
The purpose of this note is to argue that degree of nonextensivity as given by Tsallis distribution obtained from maximum entropy principle has a different origin than nonextensivity inferred from pseudo-additive property of Tsallis…
The identification of influential spreaders in complex networks is a popular topic in studies of network characteristics. Many centrality measures have been proposed to address this problem, but most have limitations. In this paper, a…