A generalization of spectral analysis with application to ranked data

DOI10.1214/aos/1176347251zbMath0688.62005OpenAlexW2026411617MaRDI QIDQ1263891

Persi Diaconis

Publication date: 1989

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176347251

zbMATH Keywords

group representationsranked datageneral homogeneous spaces

Mathematics Subject Classification ID

Related Items (51)

Linear rank tests of uniformity: understanding inconsistent outcomes and the construction of new tests ⋮ The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg) ⋮ Statistics for phylogenetic trees ⋮ A fast Fourier transform for the Johnson graph ⋮ On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics ⋮ Harmonic representatives in homology over arbitrary fields ⋮ Social order statistics models for ranking data with analysis of preferences in social networks ⋮ Statistical ranking and combinatorial Hodge theory ⋮ Separation of variables and the computation of Fourier transforms on finite groups. II ⋮ Unnamed Item ⋮ Uncovering the riffled independence structure of ranked data ⋮ An Efficient Alternative to Average Ranks for Testing with Incomplete Ranking Data ⋮ Interpreting the phase spectrum in Fourier analysis of partial ranking data ⋮ Fast Fourier analysis for abelian group extensions ⋮ An analytical approach to consensus ⋮ Model-based clustering for multivariate partial ranking data ⋮ Inferring Sparse Preference Lists from Partial Information ⋮ Markov bases for noncommutative Fourier analysis of ranked data ⋮ Probability models on rankings ⋮ Monopoles, dipoles, and harmonic functions on Bratteli diagrams ⋮ Finite Gel'fand pairs and their applications to probability and statistics ⋮ Computational bounds for doing harmonic analysis on permutation modules of finite groups ⋮ Fast Fourier Transforms for Symmetric Groups: Theory and Implementation ⋮ Comparative and compound consensus ⋮ Existence and efficient construction of fast Fourier transforms on supersolvable groups ⋮ A mixture model for preferences data analysis ⋮ Bayesian analysis of order-statistics models for ranking data ⋮ Inverse semigroup spectral analysis for partially ranked data ⋮ The efficient computation of Fourier transforms on the symmetric group ⋮ Prior distributions on symmetric groups ⋮ Conjugacy Class Prior Distributions on Metric-Based Ranking Models ⋮ Nonlinear approximation theory on compact groups ⋮ Harmonic analysis on a finite homogeneous space II: The Gelfand–Tsetlin decomposition ⋮ Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\) ⋮ Fast Fourier transforms for the rook monoid ⋮ Fast Fourier transforms for finite inverse semigroups ⋮ Canonical Decompositions and Invariants for Data Analysis ⋮ The efficient computation of Fourier transforms on semisimple algebras ⋮ Bootstrapping phylogenetic trees: theory and methods ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis ⋮ Algebraic algorithms for sampling from conditional distributions ⋮ Efficient Computation of the Fourier Transform on Finite Groups ⋮ Adjacency-based regularization for partially ranked data with non-ignorable missing ⋮ Reflections acting efficiently on a building ⋮ Harmonic analysis on \(SL(2,\mathbb{C})\) and projectively adapted pattern representation ⋮ Asymptotic properties of Lee distance ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Fourier Inversion for Finite Inverse Semigroups ⋮ A nonparametric procedure for testing partially ranked data ⋮ Fast Fourier transform for fitness landscapes ⋮ Improved upper complexity bounds for the discrete Fourier transform

This page was built for publication: A generalization of spectral analysis with application to ranked data