On the unlinking conjecture of independent polynomial functions
The celebrated U-conjecture states that under the Nn(0,In) distribution of the random vector X=(X1,...,Xn) in , two polynomials P(X) and Q(X) are unlinkable if they are independent [see Kagan et al., Characterization Problems in Mathematical Statistics, Wiley, New York, 1973]. Some results have been established in this direction, although the original conjecture is yet to be proved in generality. Here, we demonstrate that the conjecture is true in an important special case of the above, where P and Q are convex nonnegative polynomials with P(0)=0.
Year of publication: |
2006
|
---|---|
Authors: | Bhandari, Subir Kumar ; Basu, Ayanendranath |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 97.2006, 6, p. 1355-1360
|
Publisher: |
Elsevier |
Subject: | Convex polynomials U-conjecture Unlinkable functions |
Saved in:
Saved in favorites
Similar items by person
-
Statistics, data analysis, and decision modeling
Evans, James R., (2013)
-
On second order efficient robust inference
Paul, Subhadeep, (2015)
-
A general set up for minimum disparity estimation
Kuchibhotla, Arun Kumar, (2015)
- More ...