相关论文: An Information-Theoretic Proof of the Kac--Bernste…
Suppose $\XX{N}$ is a uniformly distributed $N$-dimensional binary vector and $\YY{N}$ is obtained by passing $\XX{N}$ through a binary symmetric channel with crossover probability $\alpha$. Recently, Courtade and Kumar postulates that…
The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…
We derive a novel version of information-disturbance theorems for mutually unbiased observables. We show that the information gain by Eve inevitably makes the outcomes by Bob in the conjugate basis not only erroneous but random.
The following problem is considered: given a joint distribution $P_{XY}$ and an event $E$, bound $P_{XY}(E)$ in terms of $P_XP_Y(E)$ (where $P_XP_Y$ is the product of the marginals of $P_{XY}$) and a measure of dependence of $X$ and $Y$.…
The paper moves a step towards the full integration of statistical mechanics and information theory. Starting from the assumption that the thermodynamical system is composed by particles whose quantized energies can be modelled as…
In quantum experiments the acquisition and representation of basic experimental information is governed by the multinomial probability distribution. There exist unique random variables, whose standard deviation becomes asymptotically…
We prove that if $X,Y$ are positive, independent, non-Dirac random variables and if for $\alpha,\beta\ge 0$, $\alpha\neq \beta$, $$ \psi_{\alpha,\beta}(x,y)=\left(y\,\tfrac{1+\beta(x+y)}{1+\alpha x+\beta…
Wyner's Common Information and a natural relaxation are studied in the special case of Gaussian random variables. The relaxation replaces conditional independence by a bound on the conditional mutual information. The main contribution is…
It is shown that, by applying a principle of information theory, one obtains Berry's conjecture regarding the high-lying quantal energy eigenstates of classically chaotic systems.
It is well known Heyde's characterization of the Gaussian distribution on the real line: Let $\xi_1, \xi_2,\dots, \xi_n$, $n\ge 2,$ be independent random variables, let $\alpha_j, \beta_j$ be nonzero constants such that…
Consider a random sample $X_1 , X_2 , ..., X_n$ drawn independently and identically distributed from some known sampling distribution $P_X$. Let $X_{(1)} \le X_{(2)} \le ... \le X_{(n)}$ represent the order statistics of the sample. The…
Mutual information $I(X;Y)$ is a useful definition in information theory to estimate how much information the random variable $Y$ holds about the random variable $X$. One way to define the mutual information is by comparing the joint…
We prove a version of a general transfer theorem for random sequences with independent random indexes in the double array limit setting under relaxed conditions. We also prove its partial inverse providing the necessary and sufficient…
Let $X_1, X_2,\ldots, X_n$ be $n$ independent and identically distributed random variables, here $n \geq 2.$ Let $X_{(1)}, X_{(2)}, \ldots, X_{(n)}$ be the order statistics of $X_1, X_2,..., X_n.$ In this note we proved that: (I) If $X_1,…
In this paper, using inverse integral transforms, we derive the exact distribution of the random variable $X$ that is involved in the ratio $Z \stackrel{d}{=} X/(X+Y)$ where $X$ and $Y$ are independent random variables having the same…
The information that two random variables $Y$, $Z$ contain about a third random variable $X$ can have aspects of shared information (contained in both $Y$ and $Z$), of complementary information (only available from $(Y,Z)$ together) and of…
A new finite form of de Finetti's representation theorem is established using elementary information-theoretic tools. The distribution of the first $k$ random variables in an exchangeable vector of $n\geq k$ random variables is close to a…
This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an…
Understanding a complex system entails capturing the non-trivial collective phenomena that arise from interactions between its different parts. Information theory is a flexible and robust framework to study such behaviours, with several…
For many-particle systems, quantum information in base n can be defined by partitioning the set of states according to the outcomes of n-ary (joint) observables. Thereby, k particles can carry k nits. With regards to the randomness of…