Related papers: Asymptotic Analysis of Run-Length Encoding

Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of single-user memoryless channels. Recently Polyanskiy et al. studied the benefit of variable-length feedback with termination (VLFT)…

In this paper, we investigate the distribution of $k$-free numbers in a class of $\alpha$-random walks on the integer lattice $\mathbb{Z}$. In these walks, the walker starts from a non-negative integer $r$ and moves to the right by $a$…

We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…

Let ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$. Our first result…

For a graph $G$ and $p\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n)_p$ is certainly the most investigated random graph model and also known as the…

We discuss asymptotics of large Boltzmann random planar maps such that every vertex of degree $k$ has weight of order $k^{-2}$. Infinite maps of that kind were studied by Budd, Curien and Marzouk. These maps can be seen as the dual of the…

The fluctuations of the passage time in first passage percolation are of great interest. We show that the non-random fluctuations in planar FPP are at least of order $\log(n)^\alpha$ for any $\alpha<1/2$ under some conditions that are known…

Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We…

We study the statistics of the condition number $\kappa=\lambda_{\mathrm{max}}/\lambda_{\mathrm{min}}$ (the ratio between largest and smallest squared singular values) of $N\times M$ Gaussian random matrices. Using a Coulomb fluid…

This paper presents lossless prefix codes optimized with respect to a pay-off criterion consisting of a convex combination of maximum codeword length and average codeword length. The optimal codeword lengths obtained are based on a new…

By random complex zeroes we mean the zero set of a random entire function whose Taylor coefficients are independent complex-valued Gaussian variables, and the variance of the k-th coefficient is 1/k!. This zero set is distribution invariant…

Unequal transition probabilities between input and output symbols, input power constraints, or input symbols of unequal durations can lead to non-uniform capacity achieving input distributions for communication channels. Using uniform input…

In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta…

Quantum stabilizer codes face the problem of low coding rate. In this article, following the idea of recursively expanding Tanner graph proposed in our previous work, we try to construct new stabilizer codes with high coding rate, and…

We derive the first four terms in a series for the order paramater (the stationary activity density rho) in the supercritical regime of a one-dimensional stochastic sandpile; in the two-dimensional case the first three terms are reported.…

The optimal prefix-free machine U is a universal decoding algorithm used to define the notion of program-size complexity H(s) for a finite binary string s. Since the set of all halting inputs for U is chosen to form a prefix-free set, the…

We consider semiparametric location-scatter models for which the $p$-variate observation is obtained as $X=\Lambda Z+\mu$, where $\mu$ is a $p$-vector, $\Lambda$ is a full-rank $p\times p$ matrix and the (unobserved) random $p$-vector $Z$…

We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…

We study optimal distributed first-order optimization algorithms when the network (i.e., communication constraints between the agents) changes with time. This problem is motivated by scenarios where agents experience network malfunctions.…

Let \xi_0,\xi_1,...,\xi_{\omega-1} be observations from the hidden Markov model with probability distribution P^{\theta_0}, and let \xi_{\omega},\xi_{\omega+1},... be observations from the hidden Markov model with probability distribution…