Limit theorems for sequences of random trees
We consider a random tree and introduce a metric in the space of trees to define the "mean tree" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent i...
Guardado en:
Autores principales: | , , , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_11330686_v18_n2_p302_Balding |
Aporte de: |
id |
todo:paper_11330686_v18_n2_p302_Balding |
---|---|
record_format |
dspace |
spelling |
todo:paper_11330686_v18_n2_p302_Balding2023-10-03T16:07:55Z Limit theorems for sequences of random trees Balding, D. Ferrari, P.A. Fraiman, R. Sued, M. D-mean Invariance principle Kolmogorov-Smirnov Random trees We consider a random tree and introduce a metric in the space of trees to define the "mean tree" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose tests to check if two samples of random trees have the same law. © 2008 Sociedad de Estadística e Investigación Operativa. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_11330686_v18_n2_p302_Balding |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
D-mean Invariance principle Kolmogorov-Smirnov Random trees |
spellingShingle |
D-mean Invariance principle Kolmogorov-Smirnov Random trees Balding, D. Ferrari, P.A. Fraiman, R. Sued, M. Limit theorems for sequences of random trees |
topic_facet |
D-mean Invariance principle Kolmogorov-Smirnov Random trees |
description |
We consider a random tree and introduce a metric in the space of trees to define the "mean tree" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose tests to check if two samples of random trees have the same law. © 2008 Sociedad de Estadística e Investigación Operativa. |
format |
JOUR |
author |
Balding, D. Ferrari, P.A. Fraiman, R. Sued, M. |
author_facet |
Balding, D. Ferrari, P.A. Fraiman, R. Sued, M. |
author_sort |
Balding, D. |
title |
Limit theorems for sequences of random trees |
title_short |
Limit theorems for sequences of random trees |
title_full |
Limit theorems for sequences of random trees |
title_fullStr |
Limit theorems for sequences of random trees |
title_full_unstemmed |
Limit theorems for sequences of random trees |
title_sort |
limit theorems for sequences of random trees |
url |
http://hdl.handle.net/20.500.12110/paper_11330686_v18_n2_p302_Balding |
work_keys_str_mv |
AT baldingd limittheoremsforsequencesofrandomtrees AT ferraripa limittheoremsforsequencesofrandomtrees AT fraimanr limittheoremsforsequencesofrandomtrees AT suedm limittheoremsforsequencesofrandomtrees |
_version_ |
1782027194646659072 |