Related papers: Cramer-Rao Lower Bound and Information Geometry
In this paper, we derive the Cramer-Rao bound (CRB) for joint target position and velocity estimation using an active or passive distributed radar network under more general, and practically occurring, conditions than assumed in previous…
Advanced super-resolution imaging techniques require specific approaches for accurate and consistent estimation of the achievable spatial resolution. Fisher information supplied to Cramer-Rao bound (CRB) has proved to be a powerful and…
In this article, we have described the Rao distance (due to C.R. Rao) and ideas of conformal mappings on 3D objects with angle preservations. Three propositions help us to construct distances between the points within the 3D objects in…
Systematic errors affecting center-of-gravity (CoG) measurements may occur from coarse sampling of the point-spread-function (PSF) or from signal truncation at the boundaries of the region-of-interest (ROI). For small ROI and PSF widths,…
The fist documented speculations on light were found in oriental and Greek schools of philosophy. The investigations on the light in India were rooted way back to the ancient era. The Indian Samkhya, Nyaya, and Vaisheshika identified light…
The recent development, shows that the Bray-Curtis's formula for similarity Index (1957), has been applied in various fields like Ecology, Astrophysics, etc. In this paper, we found the possible boundary conditions for this evolved formula…
Contribution of Indian Mathematics since Vedic Period has been recognised by the Historians. Pingala (200 BC) in his book on 'Chandashaastra', a text related to the description and analysis of meters in poetic work, describes algorithms…
This is a translation of Harald Cram\'er's article, 'On a new limit theorem in probability theory', published in French in 1938 and deriving what is considered by mathematicians to be the first large deviation result. My hope is that this…
We derive an asymptotic lower bound on the Bayes risk when N identical quantum systems whose state depends on a vector of unknown parameters are jointly measured in an arbitrary way and the parameters of interest estimated on the basis of…
Circulant graphs have been used to effectively establish lower bounds on many classical Ramsey numbers. Here, we construct circulant graphs of prime order that sharpen the best published lower bounds on two Ramsey numbers. Generalizing…
We present new methods for assessing the privacy guarantees of an algorithm with regard to R\'enyi Differential Privacy. To the best of our knowledge, this work is the first to address this problem in a black-box scenario, where only…
Leo Breiman was a highly creative, influential researcher with a down-to-earth personal style and an insistence on working on important real world problems and producing useful solutions. This paper is a short review of Breiman's extensive…
A well-known technique in estimating probabilities of rare events in general and in information theory in particular (used, e.g., in the sphere-packing bound), is that of finding a reference probability measure under which the event of…
We investigate the existence of a statistical-computational gap in multiple Gaussian graph alignment. We first generalize a previously established informational threshold from Vassaux and Massouli\'e (2025) to regimes where the number of…
We review Exoo's 1989 paper, which demonstrates that a lower bound for the Ramsey number $R(5,5)$ is $43$. We provide an efficient way to verify the claims in the paper, adding detailed proofs. In particular, we replace the reference to…
This comment emphasizes the importance of model checking and model fitting when making inferences about finite population quantities. It also suggests the value of using unit level models when making inferences for small subpopulations,…
This letter aims at extending the Constrained Semiparametric Cramer-Rao Bound (CSCRB) for the joint estimation of mean vector and scatter matrix of Real Elliptically Symmetric (RES) distributions to Complex Elliptically Symmetric (CES)…
The theory of random graphs goes back to the late 1950s when Paul Erd\H{o}s and Alfr\'ed R\'enyi introduced the Erd\H{o}s-R\'enyi random graph. Since then many models have been developed, and the study of random graph models has become…
To any parametric family of states of a finite level quantum system we associate a space of Fisher maps and introduce the natural notions of Cram\'er-Rao-Bhattacharya tensor and Fisher information form. This leads us to an abstract…
In a 1989 paper titled "shortest paths without a map", Papadimitriou and Yannakakis introduced an online model of searching in a weighted layered graph for a target node, while attempting to minimize the total length of the path traversed…