Related papers: Cramer-Rao Lower Bound and Information Geometry
This paper proposes an original Riemmanian geometry for low-rank structured elliptical models, i.e., when samples are elliptically distributed with a covariance matrix that has a low-rank plus identity structure. The considered geometry is…
The Jesuit scientist Christopher Clavius (1538-1612) has been the most influential teacher of the renaissance. His contributions to algebra, geometry, astronomy and cartography are enormous. He paved the way, with his texts and his teaching…
Multiple antenna arrays play a key role in wireless networks for communications but also localization and sensing. The use of large antenna arrays pushes towards a propagation regime in which the wavefront is no longer plane but spherical.…
This paper reviews Holevo's contributions to quantum information theory during the 20 century. At that time, he mainly studied three topics, classical-quantum channel coding, quantum estimation with Cramero-Rao approach, and quantum…
Jacobi is one of the most famous mathematicians of his century. His name is attached to many results in various fields of mathematics and his complete works in seven volumes have been available since the end of the XIXth century and are…
The Cramer-Rao lower bound for the estimation of the affine transformation parameters in a multivariate heteroscedastic errors-in-variables model is derived. The model is suitable for feature-based image registration in which both sets of…
We review the progress made on bounding the number of independent sets in $d$-regular and irregular graphs over the last 31 years. We particularly focus on contributions from Kahn, Zhao, and Sah et al. in incrementally proving stronger and…
In this paper, we derive the information theoretic performance bounds on communication data rates and errors in parameter estimation, for a joint radar and communication (JRC) system. We assume that targets are semi-passive, i.e. they use…
We study the multicolor Ramsey numbers for paths and even cycles, $R_k(P_n)$ and $R_k(C_n)$, which are the smallest integers $N$ such that every coloring of the complete graph $K_N$ has a monochromatic copy of $P_n$ or $C_n$ respectively.…
This review aims at gathering the most relevant quantum multi-parameter estimation methods that go beyond the direct use of the Quantum Fisher Information concept. We discuss in detail the Holevo Cram\'er-Rao bound, the Quantum Local…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
The most outstanding contribution to general relativity in this era came in 1953 (published in 1955 \cite{akr}) in the form of the Raychaudhri equation. It is in 1960s that the observations began to confront the eupherial theory and thus…
We obtain some optimal inequalities on tail probabilities for sums of independent bounded random variables. Our main result completes an upper bound on tail probabilities due to Talagrand by giving a one-term asymptotic expansion for large…
November 27, 2004, marked the 250th anniversary of the death of Abraham De Moivre, best known in statistical circles for his famous large-sample approximation to the binomial distribution, whose generalization is now referred to as the…
In this paper, we address the theoretical limitations in reconstructing sparse signals (in a known complete basis) using compressed sensing framework. We also divide the CS to non-blind and blind cases. Then, we compute the Bayesian…
This article is a review of theoretical advances in the research field of algebraic geometry and Bayesian statistics in the last two decades. Many statistical models and learning machines which contain hierarchical structures or latent…
This paper reports a comprehensive study of distributional uncertainty in a few socio-economic indicators across the various states of India over the years 2001-2011. We show that the DGB distribution, a typical rank order distribution,…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
In this paper we investigate a parameter of graphs, called the circular altitude, introduced by Peter Cameron. We show that the circular altitude provides a lower bound on the circular chromatic number, and hence on the chromatic number, of…
We present a parameter retrieval method which combines ptychography and additional prior knowledge about the object. The proposed method is applied to two applications: (1) parameter retrieval of small particles from Fourier ptychographic…