Search arXivSearch

arXiv · 0811.3777

The Relationship between Tsallis Statistics, the Fourier Transform, and Nonlinear Coupling

Abstract

Tsallis statistics (or q-statistics) in nonextensive statistical mechanics is a one-parameter description of correlated states. In this paper we use a translated entropic index: $1 - q \to q$ . The essence of this translation is to improve the mathematical symmetry of the q-algebra and make q directly proportional to the nonlinear coupling. A conjugate transformation is defined $\hat q \equiv \frac{- 2q}{2 + q}$ which provides a dual mapping between the heavy-tail q-Gaussian distributions, whose translated q parameter is between $ - 2 < q < 0$, and the compact-support q-Gaussians, between $0 < q < \infty $ . This conjugate transformation is used to extend the definition of the q-Fourier transform to the domain of compact support. A conjugate q-Fourier transform is proposed which transforms a q-Gaussian into a conjugate $\hat q$ -Gaussian, which has the same exponential decay as the Fourier transform of a power-law function. The nonlinear statistical coupling is defined such that the conjugate pair of q-Gaussians have equal strength but either couple (compact-support) or decouple (heavy-tail) the statistical states. Many of the nonextensive entropy applications can be shown to have physical parameters proportional to the nonlinear statistical coupling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kenric P. Nelson, Sabir Umarov. 2008-11-23. The Relationship between Tsallis Statistics, the Fourier Transform, and Nonlinear Coupling. https://arxiv.org/abs/0811.3777

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT