Related papers: Cramer-Rao Lower Bound and Information Geometry
This paper establishes the privacy-preserving Cram\'er-Rao (CR) lower bound theory, characterizing the fundamental limit of identification accuracy under privacy constraint. An identifiability criterion under privacy constraint is derived…
When dealing with a parametric statistical model, a Riemannian manifold can naturally appear by endowing the parameter space with the Fisher information metric. The geometry induced on the parameters by this metric is then referred to as…
The known lower bound for the the classical Ramsey number $R(5,6)$ is improved from $58$ to $59$. The method used to construct the graph is a simple variant of computational methods that have been previously used to construct Ramsey graphs.…
The manifold of empirical mean values of statistical data ad infinitum has a geometric shape that depends on the probability measure that governs the generating model. Large deviation theory produces entropy functions that depend on both…
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by…
Rejoinder of "Impact of Frequentist and Bayesian Methods on Survey Sampling Practice: A Selective Appraisal" by J. N. K. Rao [arXiv:1108.2356]
The author studies the Cramer-Rao type bound by a linear programming approach. By this approach, he found a necessary and sufficient condition that the Cramer-Rao type bound is attained by a random measurement. In a spin 1/2 system, this…
The relative $\alpha$-entropy is the R\'enyi analog of relative entropy and arises prominently in information-theoretic problems. Recent information geometric investigations on this quantity have enabled the generalization of the…
In his 2005 paper, S.T. Smith proposed an intrinsic Cram\'er-Rao bound on the variance of estimators of a parameter defined on a Riemannian manifold. In the present technical note, we consider the special case where the parameter lives in a…
For decoherence processes induced by weak interactions with the environment, a general quantum channel with one noise parameter has been formulated. This channel is called low-noise channel and very useful for investigating the parameter…
This post is the author's doctoral dissertation back in 1997. The dissertation covers following four kinds of problems: First, it studies achievable Cramer-Rao type bounds of various multi-parameter pure state models. Second, it relates…
The introduction of a metric onto the space of parameters in models in Statistical Mechanics and beyond gives an alternative perspective on their phase structure. In such a geometrization, the scalar curvature, R, plays a central role. A…
This paper studies distance estimation for diffusive molecular communication. The Cramer-Rao lower bound on the variance of the distance estimation error is derived. The lower bound is derived for a physically unbounded environment with…
The first paper in systolic geometry was published by Loewner's student P. M. Pu over half a century ago. Pu proved an inequality relating the systole and the area of an arbitrary metric on the real projective plane. We prove a stronger…
There are many information and divergence measures exist in the literature on information theory and statistics. The most famous among them are Kullback-Leiber relative information and Jeffreys J-divergence. The measures like, Bhattacharya…
Strong refutation of random CSPs is a fundamental question in theoretical computer science that has received particular attention due to the long-standing gap between the information-theoretic limit and the computational limit. This gap is…
Prof. K.G Ramanathan was a legendary Indian Mathematician, working in Number Theory and a prolific Institution builder. Apart from this, he was an excellent teacher and influenced several brilliant students. In this article, we overview his…
This paper derives a general expression for the Cram\'er-Rao bound (CRB) of wireless localization algorithms using range measurements subject to bias corruption. Specifically, the a priori knowledge about which range measurements are…
We derive the closed form Cramer-Rao bound (CRB) expressions for joint estimation of time delay and Doppler shift with unknown signals with possibly known structure. The results are especially useful for passive radar where direct path and…
The following relaxation of the classical problem of determining Ramsey number of a fixed graph has first been proposed by Erdos, Hajnal and Rado over 50 years ago. Given a graph $G$ and an integer $t \geq 2$ determine the minimum number…