Related papers: Tail redundancy and its characterization of compre…
Loynes' distribution, which characterizes the one dimensional marginal of the stationary solution to Lindley's recursion, possesses an ultimately exponential tail for a large class of increment processes. If one can observe increments but…
We study the fluctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of…
An explicit upper bound on the tail probabilities for the normalized Rademacher sums is given. This bound, which is best possible in a certain sense, is asymptotically equivalent to the corresponding tail probability of the standard normal…
We consider a two dimensional skip-free reflecting random walk on a nonnegative integer quadrant. We are interested in the tail asymptotics of its stationary distribution, provided its existence is assumed. We derive exact tail asymptotics…
Sequential probability assignment and universal compression go hand in hand. We propose sequential probability assignment for non-binary (and large alphabet) sequences with empirical distributions whose parameters are known to be bounded…
In this paper, asymptotic behavior of convolution of distributions belonging to two subclasses of distributions with exponential tails are considered, respectively. The precise second-order tail asymptotics of the convolutions are derived…
In this paper we study (asymptotic) properties of the $*$-distribution of irreducible characters of finite quantum groups. We proceed in two steps, first examining the representation theory to determine irreducible representations and their…
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…
Many services today massively and continuously produce log files of different and varying formats. These logs are important since they contain information about the application activities, which is necessary for improvements by analyzing…
Proliferating cell populations at steady state growth often exhibit broad protein distributions with exponential tails. The sources of this variation and its universality are of much theoretical interest. Here we address the problem by…
We discuss in this paper a possibility of constructing a whole class of asymptotic distribution-free tests for testing regularly varying tail distributions. The idea is that we treat the tails of distributions as members of a parametric…
From mostly a measure-theoretic consideration, we show that for every nonnegative, finite, and $L^{1}$ function on a given finite measure space there is some nontrivial sequence of real numbers such that the series, obtained from summing…
Neural network compression has been an increasingly important subject, not only due to its practical relevance, but also due to its theoretical implications, as there is an explicit connection between compressibility and generalization…
In the framework of chaotic scattering we analyze passive tracer transport in finite systems. In particular, we study models with open streamlines and a finite number of recirculation zones. In the non trivial case with a small number of…
We reconsider a classical, well-studied problem from applied probability. This is the max-sum equivalence of randomly weighted sums, and the originality is because we manage to include interdependence among the primary random variables, as…
We consider the problem of distilling uniform random bits from an unknown source with a given $p$-entropy using linear hashing. As our main result, we estimate the expected $p$-divergence from the uniform distribution over the ensemble of…
In this work, we propose a class of importance sampling (IS) estimators for estimating the right tail probability of a sum of continuous random variables based on a change of variables to $L^1$ polar coordinates in which the radial and…
The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets ($\infty$-alphabets) is addressed in this paper. The main…
In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…
The $*$-spread of an ideal is defined as the minimal number of generators of an ideal which is minimal with respect to having the same tight closure as the original ideal. We prove an asymptotic length formula for the $*$-spread.