Band depths based on multiple time instances

Bands of vector-valued functions $f:T\mapsto\mathbb{R}^d$ are defined by considering convex hulls generated by their values concatenated at $m$ different values of the argument. The obtained $m$-bands are families of functions, ranging from the conventional band in case the time points are individually considered (for $m=1$) to the convex hull in the functional space if the number $m$ of simultaneously considered time points becomes large enough to fill the whole time domain. These bands give rise to a depth concept that is new both for real-valued and vector-valued functions.Comment: 12 page

On the concept of depth for functional data

The statistical analysis of functional data is a growing need in many research areas. We propose a new depth notion for functional observations based on the graphic representation of the curves. Given a collection of functions, it allows to establish the centrality of a function and provides a natural center-outward ordering of the sample curves. Robust statistics such as the median function or a trimmed mean function can be defined from this depth definition. Its finite-dimensional version provides a new depth for multivariate data that is computationally very fast and turns out to be convenient to study high-dimensional observations. The natural properties are established for the new depth and the uniform consistency of the sample depth is proved. Simulation results show that the trimmed mean presents a better behavior than the mean for contaminated models. Several real data sets are considered to illustrate this new concept of depth. Finally, we use this new depth to generalize to functions the Wilcoxon rank sum test. It allows to decide whether two groups of curves come from the same population. This functional rank test is applied to girls and boys growth curves concluding that they present different growth patterns

Simplicial similarity and its application to hierarchical clustering

In the present document, an extension of the statistical depth notion is introduced with the aim to allow for measuring proximities between pairs of points. In particular, we will extend the simplicial depth function, which measures how central is a point by using random simplices (triangles in the two-dimensional space). The paper is structured as follows: In first place, there is a brief introduction to statistical depth functions. Next, the simplicial similarity function will be defined and its properties studied. Finally, we will present a few graphical examples in order to show its behavior with symmetric and asymmetric distributions, and apply the function to hierarchical clustering.Statistical depth, Similarity measures, Hierarchical clustering