Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T21:13:01.542Z Has data issue: false hasContentIssue false

Limit Theorems for the Inductive Mean on Metric Trees

Published online by Cambridge University Press:  14 July 2016

Bojan Basrak*
Affiliation:
University of Zagreb
*
∗ Postal address: Mathematics Department, University of Zagreb, Bijenička 30, Zagreb, Croatia. Email address: bbasrak@math.hr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For random variables with values on binary metric trees, the definition of the expected value can be generalized to the notion of a barycenter. To estimate the barycenter from tree-valued data, the so-called inductive mean is constructed recursively using the weighted interpolation between the current mean and a new data point. We show the strong consistency of the inductive mean, but also that it, somewhat peculiarly, converges towards the true barycenter with different rates, and asymptotic distributions depending on the small variations of the underlying distribution.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010