Inverse semigroup spectral analysis for partially ranked data
From MaRDI portal
Abstract: Motivated by the notion of symmetric group spectral analysis developed by Diaconis, we introduce the notion of spectral analysis on the rook monoid (also called the symmetric inverse semigroup), characterize its output in terms of symmetric group spectral analysis, and provide an application to the statistical analysis of partially ranked (voting) data. We also discuss generalizations to arbitrary finite inverse semigroups. This paper marks the first non-group semigroup development of spectral analysis.
Recommendations
- A generalization of spectral analysis with application to ranked data
- scientific article; zbMATH DE number 475357
- Metric methods for analyzing partially ranked data
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Canonical decompositions and invariants for data analysis.
Cites work
- scientific article; zbMATH DE number 3123157 (Why is no real title available?)
- scientific article; zbMATH DE number 3125734 (Why is no real title available?)
- scientific article; zbMATH DE number 3125735 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 459354 (Why is no real title available?)
- scientific article; zbMATH DE number 464655 (Why is no real title available?)
- scientific article; zbMATH DE number 475357 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 910881 (Why is no real title available?)
- A Natural Partial Order for Semigroups
- A generalization of spectral analysis with application to ranked data
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Fast Fourier transforms for finite inverse semigroups
- Fast Fourier transforms for the rook monoid.
- Fast Fourier transforms for wreath products
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- On the structure of semigroups
- Representations of the rook monoid.
- Separation of variables and the computation of Fourier transforms on finite groups, I
- The efficient computation of Fourier transforms on the symmetric group
- The representation type of the full transformation semigroup \(T_4\)
Cited in
(8)- Interpreting the phase spectrum in Fourier analysis of partial ranking data
- The efficient computation of Fourier transforms on semisimple algebras
- Simplicity of augmentation submodules for transformation monoids
- A generalization of spectral analysis with application to ranked data
- Fourier inversion for finite inverse semigroups
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Character theory of monoids over an arbitrary field.
- scientific article; zbMATH DE number 475357 (Why is no real title available?)
This page was built for publication: Inverse semigroup spectral analysis for partially ranked data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252126)