Graph-theoretic measures of multivariate association and prediction
From MaRDI portal
Publication:786491
DOI10.1214/aos/1176346148zbMath0528.62052OpenAlexW2077584453MaRDI QIDQ786491
Lawrence C. Rafsky, Jerome H. Friedman
Publication date: 1983
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176346148
predictionasymptotic normalitypermutation statisticsdistribution-free tests of independenceexamination of residualsgeneralized correlation coefficientsinterpoint-distance-based graphsnon- monotone alternatives
Nonparametric hypothesis testing (62G10) Measures of association (correlation, canonical correlation, etc.) (62H20) Graph theory (05C99)
Related Items
On some exact distribution-free tests of independence between two random vectors of arbitrary dimensions ⋮ Symmetrical independence tests for two random vectors with arbitrary dimensional graphs ⋮ Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours ⋮ Graph-theoretic multisample tests of equality in distribution for high dimensional data ⋮ Intrinsic dimension estimation: relevant techniques and a benchmark framework ⋮ The central limit theorem for Euclidean minimal spanning trees. I ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ Measuring association with Wasserstein distances ⋮ The Binary Expansion Randomized Ensemble Test ⋮ Multivariate Rank-Based Distribution-Free Nonparametric Testing Using Measure Transportation ⋮ Limiting distributions of graph-based test statistics on sparse and dense graphs ⋮ Asymptotic normality of double-indexed linear permutation statistics ⋮ On some consistent tests of mutual independence among several random vectors of arbitrary dimensions ⋮ A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. ⋮ Efficient nonparametric testing by functional estimation ⋮ On the number of weakly connected subdigraphs in random \(k\)NN digraphs ⋮ The random minimal spanning tree in high dimensions ⋮ Resistant estimation of multivariate location using minimum spanning trees ⋮ An unbiased method for constructing multilabel classification trees ⋮ Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family ⋮ Testing the equality of distributions of random vectors with categorical components. ⋮ Explicit laws of large numbers for random nearest-neighbour-type graphs ⋮ On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data ⋮ A new coefficient of correlation ⋮ An algorithm for simulating permutation tests of graph-intersection measures of association ⋮ A classification of isomorphism-invariant random digraphs ⋮ Nonparametric tests of independence based on interpoint distances ⋮ Model-based methods to identify multiple cluster structures in a data set ⋮ On the asymptotic null distribution of the symmetrized Chatterjee's correlation coefficient ⋮ A conversation with Jerry Friedman ⋮ Non-metric statistical analyses: Some metric alternatives
