Related papers: Cramer-Rao Lower Bound and Information Geometry

We present novel lower bounds on the localization error using a network of satellites randomly deployed on a sphere around Earth. Our new analysis approach characterizes the localization performance by its asymptotic behavior as the number…

Discussion of "Impact of Frequentist and Bayesian Methods on Survey Sampling Practice: A Selective Appraisal" by J. N. K. Rao [arXiv:1108.2356]

Discussion of "Impact of Frequentist and Bayesian Methods on Survey Sampling Practice: A Selective Appraisal" by J. N. K. Rao [arXiv:1108.2356]

We address the feasibility of a GNSS-R code-altimetry space mission and more specifically a dominant term of its error budget: the reflected-signal range precision. This is the RMS error on the reflected-signal delay, as estimated by…

With a bird's-eye view, we survey the landscape of Calabi-Yau threefolds, compact and non-compact, smooth and singular. Emphasis will be placed on the algorithms and databases which have been established over the years, and how they have…

We present a pedagogical introduction to the recent advances in the computational geometry, physical implications, and data science of Calabi-Yau manifolds. Aimed at the beginning research student and using Calabi-Yau spaces as an exciting…

In this work we study both the index coding with side information (ICSI) problem introduced by Birk and Kol in 1998 and the more general problem of index coding with coded side information (ICCSI), described by Shum et al in 2012. We…

We give a new lower bound on the expansion coefficient of an edge-vertex graph of a $d$-regular graph. As a consequence, we obtain an improvement on the lower bound on relative minimum distance of the expander codes constructed by Sipser…

Statistical distance measures have found wide applicability in information retrieval tasks that typically involve high dimensional datasets. In order to reduce the storage space and ensure efficient performance of queries, dimensionality…

The aim of this research paper is to demonstrate how one can obtain eleven new and interesting hypergeometric identities (in the form of a single result) from the old ones by mainly applying the well known beta integral method which was…

The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…

Latent space geometry has shown itself to provide a rich and rigorous framework for interacting with the latent variables of deep generative models. The existing theory, however, relies on the decoder being a Gaussian distribution as its…

This paper addresses the real-time state estimation problem for dynamic systems while protecting exogenous inputs against adversaries, who may be honest-but-curious third parties or external eavesdroppers. The Cram\'er-Rao lower bound…

Using cyclic graphs I give new lower bounds for two color and multicolor Ramsey numbers: R(4,16)>163, R(5,11)>170, R(5,12)>190, R(5,13)>212, R(5,14)>238, R(3,3,9)>117, R(3,3,10)>141 and R(3,3,11)>157. Improving the previous best known…

To achieve the joint active and passive beamforming gains in the reconfigurable intelligent surface assisted millimeter wave system, the reflected cascade channel needs to be accurately estimated. Many strategies have been proposed in the…

Parameter estimation is a fundamental problem in science and engineering. In many safety-critical applications, one is not only interested in a {\it point} estimator, but also the uncertainty bound that can self-assess the accuracy of the…

This paper lays the foundations for a unified framework for numerically and computationally applying methods drawn from a range of currently distinct geometrical approaches to statistical modelling. In so doing, it extends information…

This paper considers the Cram\`er-Rao lower Bound (CRB) for the source localization problem in the near field. More specifically, we use the exact expression of the delay parameter for the CRB derivation and show how this exact CRB can be…

We have developed a (freeware) routine for "referenced publication years spectroscopy" (RPYS) and apply this method to the historiography of "iMetrics," that is, the junction of the journals Scientometrics, Informetrics, and the relevant…

Herein we present a novel approach of identifying community structures in complex networks. We propose the usage of the Random Walk Centrality (RWC), first introduced by Noh and Rieger [Phys. Rev. Lett. 92.11 (2004): 118701]. We adapt this…