Related papers: Cramer-Rao Lower Bound and Information Geometry
Karl Pearson played an enormous role in determining the content and organization of statistical research in his day, through his research, his teaching, his establishment of laboratories, and his initiation of a vast publishing program. His…
The performance bounds of near-field sensing are studied for circular arrays, focusing on the impact of bandwidth and array size. The closed-form Cramer-Rao bound (CRBs) for angle and distance estimation are derived, revealing the scaling…
We present a new inner bound for the rate region of the $t$-stage successive-refinement problem with side-information. We also present a new upper bound for the rate-distortion function for lossy-source coding with multiple decoders and…
Yehuda Vardi introduced the term network tomography and was the first to propose and study how statistical inverse methods could be adapted to attack important network problems (Vardi, 1996). More recently, in one of his final papers, Vardi…
S.B. Rao conjectured in 1971 that graphic degree sequences are well quasi ordered by a relation defined in terms of the induced subgraph relation. In 2008, M. Chudnovsky and P. Seymour proved this long standing Rao's Conjecture by giving…
In the first part of this short work (in the form of a comment) we add the plots of two more values of the Li-Keiper coefficients lambda5 and lambda6, computed as in our recent work where the first four values were in particular given. This…
In recent years, biodiversity measures have gained prominence as essential tools for ecological and environmental assessments, particularly in the context of increasingly complex and large-scale datasets. We provide a comprehensive review…
In robotic networks relying on noisy range measurements between agents for cooperative localization, the achievable positioning accuracy strongly strongly depends on the network geometry. This motivates the problem of planning robot…
This is an intrusion in the life and the mathematics of Norbert A'Campo, intended to be a tribute to him and an acknowledgement of his impact on those who know him and his work. The final version of this paper appears in the book ``Essays…
Recently, several high-resolution parameter estimation algorithms have been developed to exploit the structure of strictly second-order (SO) non-circular (NC) signals. They achieve a higher estimation accuracy and can resolve up to twice as…
The use of prior information in the linear regression is well known to provide more efficient estimators of regression coefficients. The methods of non-stochastic restricted regression estimation proposed by Theil and Goldberger (1961) are…
In his 1947 paper that inaugurated the probabilistic method, Erd\H{o}s proved the existence of $2\log{n}$-Ramsey graphs on $n$ vertices. Matching Erd\H{o}s' result with a constructive proof is a central problem in combinatorics, that has…
This book is a collection of papers dedicated to the memory of Yehuda Vardi. Yehuda was the chair of the Department of Statistics of Rutgers University when he passed away unexpectedly on January 13, 2005. On October 21--22, 2005, some 150…
For a graph $H$ and an integer $n$, we let $nH$ denote the disjoint union of $n$ copies of $H$. In 1975, Burr, Erd\H{o}s, and Spencer initiated the study of Ramsey numbers for $nH$, one of few instances for which Ramsey numbers are now…
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…
The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…
Side information provides a pivotal role for message delivery in many communication scenarios to accommodate increasingly large data sets, e.g., caching networks. Although index coding provides a fundamental modeling framework to exploit…
Rajagopalan and Sabir [nlin.CD/0104021 and Phys. Rev. E 63, 057201 (2001)] recently discussed deterministic diffusion in a piecewise linear map using an approach developed by Fujisaka et al. We first show that they rederived the random walk…
Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…
Graph Laplacians and related nonlinear mappings into low dimensional spaces have been shown to be powerful tools for organizing high dimensional data. Here we consider a data set X in which the graph associated with it changes depending on…