Related papers: Asymptotic optimality of scalar Gersho quantizers
It is shown that the following holds for each $\varepsilon>0$. For $G$ an $n$-vertex graph of maximum degree $D$ and "lists" $L_v$ ($v \in V(G)$) chosen independently and uniformly from the ($(1+\varepsilon)\ln n$)-subsets of $\{1, ...,…
Given a channel having binary input X = (x_1, x_2) having the probability distribution p_X = (p_{x_1}, p_{x_2}) that is corrupted by a continuous noise to produce a continuous output y \in Y = R. For a given conditional distribution…
We study asymptotic behavior of one-step $M$-estimators based on samples from arrays of not necessarily identically distributed random variables and representing explicit approximations to the corresponding consistent $M$-estimators. These…
To overcome the difficulties in determining an inverse compressor function for a Gaussian source, which appear in designing the nonlinear optimal companding quantizers and also in the nonlinear optimal companding quantization procedure, in…
In some cases, solutions to nonlinear PDEs happen to be asymptotically (for large $x$ and/or $t$) invariant under a group $G$ which is not a symmetry of the equation. After recalling the geometrical meaning of symmetries of differential…
We first review asymptotic twistor theory with its real subspace of null asymptotic twistors. This is followed by a description of an asymptotic version of the Kerr theorem that produces regular asymptotically shear free null geodesic…
This paper is concerned with the problem of conditional independence testing for discrete data. In recent years, researchers have shed new light on this fundamental problem, emphasizing finite-sample optimality. The non-asymptotic viewpoint…
We compute the effective potential for scalar fields in asymptotically safe quantum gravity. A scaling potential and other scaling functions generalize the fixed point values of renormalizable couplings. The scaling potential takes a…
Grey-scale local algorithms have been suggested as a fast way of estimating surface area from grey-scale digital images. Their asymptotic mean has already been described. In this paper, the asymptotic behaviour of the variance is studied in…
For any vacuum initial data set, we define a local, non-negative scalar quantity which vanishes at every point of the data hypersurface if and only if the data are {\em Kerr initial} data. Our scalar quantity only depends on the quantities…
Higher criticism is a large-scale testing procedure that can attain the optimal detection boundary for sparse and faint signals. However, there has been a lack of knowledge in most existing works about its asymptotic distribution for more…
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…
In this work, we compute the precise late-time asymptotics for the scalar field in the interior of a non-static subextreme Kerr black hole, based on recent progress on deriving its precise asymptotics in the Kerr exterior region. This…
In this paper we characterize the set of bipartite non-signalling probability distributions in terms of tensor norms. Using this characterization we give optimal upper and lower bounds on Bell inequality violations when non-signalling…
In quantum purity amplification, one is given $n$ copies of a noisy quantum state $\rho \in \mathbb{C}^{d \times d}$ and asked to prepare $k$ copies of its principal eigenstate $|v_d\rangle$. Several prior works have derived…
The representation of a given quantity with less information is often referred to as `quantization' and it is an important subject in information theory. In this paper, we have considered absolutely continuous probability measures on unit…
We obtain optimal Gaussian concentration bounds (GCBs) for stochastic chains of unbounded memory (SCUMs) on countable alphabets. These stochastic processes are also known as "chains with complete connections" or "$g$-measures". We consider…
Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled…
This paper presents a detailed study of constrained quantization for both finite and infinite discrete probability distributions supported on subsets of the real line. Under specific geometric constraints - namely, a semicircular arc and…
We prove the equality case of the Penrose inequality in all dimensions for asymptotically flat hypersurfaces. It was recently proven by G. Lam that the Penrose inequality holds for asymptotically flat graphical hypersurfaces in Euclidean…