Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T08:57:17.663Z Has data issue: false hasContentIssue false

On explicit and Fréchet-optimal lower bounds

Published online by Cambridge University Press:  14 July 2016

Eugene Seneta*
Affiliation:
University of Sydney
John Tuhao Chen*
Affiliation:
Bowling Green State University
*
∗ Postal address: School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia. Email address: eseneta@maths.usyd.edu.au
∗∗ Postal address: Department of Mathematics and Statistics, Bowling Green State University, Bowling Green, OH 43403, USA.

Abstract

Ease of computation of Fréchet-optimal lower bounds, given numerical values of the binomial moments S ij , i, j = 1, 2, is demonstrated. A sufficient condition is given for an explicit bivariate bound of Dawson-Sankoff structure to be Fréchet optimal. An example demonstrates that in the bivariate case even the multiplicative structure of the S ij does not guarantee a Dawson-Sankoff structure for Fréchet-optimal bounds. A final section is used to illuminate the nature of Fréchet optimality by using generalized explicit bounds. This note is a sequel to both Chen and Seneta (1995) and Chen (1998).

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2002 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable