Related papers: Universal Densities Exist for Every Finite Referen…

We obtain large deviation results for non-uniformly expanding maps with non-flat singularities or criticalities and for partially hyperbolic non-uniformly expanding attracting sets. That is, given a continuous function we consider its space…

The view that the probability density function (PDF) of a key statistical variable, anomalously scaled by size or time, could furnish a hallmark of universal behavior contrasts with the circumstance that such density sensibly depends on…

We derive the density evolution equations for non-binary low-density parity-check (LDPC) ensembles when transmission takes place over the binary erasure channel. We introduce ensembles defined with respect to the general linear group over…

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of…

In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. The Fibonacci distributions…

We survey a new area of parameter-free similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extraction. Given a family of distances on a set of objects, a distance is universal up to a…

Weakly almost i.i.d. quantum sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We establish…

Universal hash functions map the output of a source to random strings over a finite alphabet, aiming to approximate the uniform distribution on the set of strings. A classic result on these functions, called the Leftover Hash Lemma, gives…

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

In classical density (or density-functional) estimation, it is standard to assume that the underlying distribution has a density with respect to the Lebesgue measure. However, when the data distribution is a mixture of continuous and…

We improve a recent result by giving the optimal conclusion possible both to the frequent universality criterion and the frequent hypercyclicity criterion using the notion of A-densities, where A refers to some weighted densities sharper…

This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope…

In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function $f \colon X \to Y$ between $\operatorname{qcb}_0$-spaces one…

A pattern is called universal in another collection of sets, when every set in the collection contains some linear and translated copy of the original pattern. Paul Erd\H{o}s proposed a conjecture that no infinite set is universal in the…

We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

The aim of this paper is to extend the concept of measure density introduced by Buck for finite unions of arithmetic progressions, to arbitrary subsets of N defined by a given system of decompositions. This leads to a variety of new…

The Lempel-Ziv universal coding scheme is asymptotically optimal for the class of all stationary ergodic sources. A problem of robustness of this property under small violations of ergodicity is studied. A notion of deficiency of…