The random Tukey depth

J. A. Cuesta-Albertos; A. Nieto-Reyes

Home/Archive/arXiv

arXiv · 0707.0167

The random Tukey depth

J. A. Cuesta-Albertos·A. Nieto-Reyes

View original source ↗Read source document ↗Export metadata ↓

Abstract

The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires the consideration of all possible one-dimensional projections. In this paper we propose a random depth which approximates the Tukey depth. It only takes into account a finite number of one-dimensional projections which are chosen at random. Thus, this random depth requires a very small computation time even in high dimensional spaces. Moreover, it is easily extended to cover the functional framework. We present some simulations indicating how many projections should be considered depending on the sample size and on the dimension of the sample space. We also compare this depth with some others proposed in the literature. It is noteworthy that the random depth, based on a very low number of projections, obtains results very similar to those obtained with other depths.

Explore related subjects

stat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

J. A. Cuesta-Albertos, A. Nieto-Reyes. 2007-07-02. The random Tukey depth. https://arxiv.org/abs/0707.0167

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A General Framework for Importance Sampling with Markov Random Walks

Although stochastic models driven by latent Markov processes are widely used, the classical importance sampling methods based on the exponential tilting for these models suffer from difficulties in computing associated eigenvalues and eigenfunctions and the plausibility of the indirect asymptotic large deviation regime for the variance of the estimator. We propose an importance sampling framework that twists the observable and latent processes separately using a link function that directly minimizes the estimator's variance. An optimal link function is chosen within the locally asymptotically normal family. We show the logarithmic efficiency of the estimator. As applications, we estimate an overflow probability under a pandemic model and the CoVaR, a measurement of the co-dependent financial systemic risk; both are beyond the scope of traditional importance sampling methods due to nonlinear features.

stat.CO↗

arXiv2026

Sequential Monte Carlo Sampling of Feasible Regions Represented by R-Functions

Feasible-region sampling and volume estimation become increasingly inefficient when constraints define only a small fraction of a convenient bounding domain. We combine R-functions, which encode compound feasibility as a continuous signed field, with sequential Monte Carlo (SMC) samplers. The proposed construction exploits not only the sign of the R-function, which determines exact feasibility, but also its continuous negative values outside the feasible set, which provide graded information on constraint violation. Logistic intermediate distributions use this information to guide particles progressively towards feasibility, while the final target distribution remains uniform on the feasible region. Experiments on intersections and unions, including disconnected cases of hyperballs, show substantial variance reductions relative to direct rejection sampling, with the statistical advantage generally increasing as the feasible fraction decreases. For sufficiently small feasible regions, these advantages persist even after accounting for computational cost. To isolate the benefit of continuous R-function information, we also compare the proposed method with an SMC sampler with a region-only (RO) construction that uses the same sequential particle machinery but retains only binary feasible/infeasible information. We demonstrate that the R-function-informed SMC method concentrates particles in the feasible region earlier and produces lower-variance volume estimates than RO.

stat.CO↗

arXiv2026

Computation of Maximum Likelihood Estimates for Multiresponse Generalized Linear Mixed Models with Non-nested, Correlated Random Effects

Estimation of generalized linear mixed models (GLMMs) with non-nested random effects structures requires approximation of high-dimensional integrals. Many existing methods are tailored to the low-dimensional integrals produced by nested designs. We explore the modifications that are required in order to adapt an EM algorithm with first-order and fully exponential Laplace approximations to a non-nested, multiple response model. The equations in the estimation routine are expressed as functions of the first four derivatives of the conditional log likelihood of an arbitrary GLMM, providing a template for future applications. We apply the method to a joint Poisson-binary model for ranking sporting teams, and discuss the estimation of a correlated random effects model designed to evaluate the sensitivity of value-added models for teacher evaluation to assumptions about the missing data process. Source code in R is provided in the online supplementary material.

stat.CO↗