Related papers: Comparative analysis of transport communication ne…
The study of how diseases spread has greatly benefited from advances in network modeling. Recently, a class of networks known as multilayer graphs has been shown to describe more accurately many real systems, making it possible to address…
It is shown that the distribution derived from the principle of maximum Tsallis entropy is a superposable Levy-type distribution. Concomitantly, the leading order correction to the limit distribution is also deduced. This demonstration…
The q-composite key predistribution scheme [1] is used prevalently for secure communications in large-scale wireless sensor networks (WSNs). Prior work [2]-[4] explores topological properties of WSNs employing the q-composite scheme for q =…
We revisit the cut-off prescriptions which are needed in order to specify completely the form of Tsallis' maximum entropy distributions. For values of the Tsallis entropic parameter $q>1$ we advance an alternative cut-off prescription and…
We propose a generalized entropy maximization procedure, which takes into account the generalized averaging procedures and information gain definitions underlying the generalized entropies. This novel generalized procedure is then applied…
We investigate localization transitions and mobility edge phenomena in one-dimensional quasiperiodic lattice models using an information theoretic framework based on the Tsallis entropy of single particle eigenstates.We employ the Tsallis…
More and more works deal with statistical systems far from equilibrium, dominated by unidirectional stochastic processes augmented by rare resets. We analyze the construction of the entropic distance measure appropriate for such dynamics.…
Quasi-power law ensembles are discussed from the perspective of nonextensive Tsallis distributions characterized by a nonextensive parameter $q$. A number of possible sources of such distributions are presented in more detail. It is further…
In this study, we employ a superstatistical approach to construct q exponential and q Maxwell Boltzmann complex networks, generalizing the concept of scale free networks. By adjusting the crossover parameter {\lambda}, we control the degree…
In this work, we derive information-theoretic properties for a modified Tsallis entropy, hereinafter referred to as q-entropy. We introduce the notions of joint q-entropy, conditional q-entropy, relative q-entropy, conditional mutual…
We have discussed the Tsallis entropy in finite $N$-unit nonextensive systems, by using the multivariate $q$-Gaussian probability distribution functions (PDFs) derived by the maximum entropy methods with the normal average and the…
Probability distributions which emerge from the formalism of nonextensive statistical mechanics have been applied to a variety of problems. In this paper we unite modeling of such distributions with the model of widespread 1/f noise. We…
The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…
The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any…
Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for…
We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…
The topology of the Internet has typically been measured by sampling traceroutes, which are roughly shortest paths from sources to destinations. The resulting measurements have been used to infer that the Internet's degree distribution is…
The distance and divergence of the probability measures play a central role in statistics, machine learning, and many other related fields. The Wasserstein distance has received much attention in recent years because of its distinctions…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
It is known that the nonextensive statistics was originally formulated for the systems composed of subsystems having same $q$. In this paper, the existence of composite system with different $q$ subsystems is investigated by fitting the…