Page 1

Displaying 1 – 2 of 2

Showing per page

Binary segmentation and Bonferroni-type bounds

Michal Černý (2011)

Kybernetika

We introduce the function Z ( x ; ξ , ν ) : = - x ϕ ( t - ξ ) · Φ ( ν t ) d t , where ϕ and Φ are the pdf and cdf of N ( 0 , 1 ) , respectively. We derive two recurrence formulas for the effective computation of its values. We show that with an algorithm for this function, we can efficiently compute the second-order terms of Bonferroni-type inequalities yielding the upper and lower bounds for the distribution of a max-type binary segmentation statistic in the case of small samples (where asymptotic results do not work), and in general for max-type random variables...

Currently displaying 1 – 2 of 2

Page 1