Fourier theoretic probabilistic inference over permutations
From MaRDI portal
Recommendations
- S_nFFT: a Julia toolkit for Fourier analysis of functions over permutations
- Uncovering the riffled independence structure of ranked data
- Recursive inversion models for permutations
- Computing expectations and marginal likelihoods for permutations
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems
Cited in
(14)- Representation theory of the symmetric group in voting theory and game theory
- Uncovering the riffled independence structure of ranked data
- Analysis of ranking data
- Interpreting the phase spectrum in Fourier analysis of partial ranking data
- Recursive inversion models for permutations
- On kernel methods for covariates that are rankings
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Estimation in exponential families on permutations
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- A noncommutative approach to the graphon Fourier transform
- Testing properties of functions on finite groups
- Extending permutation conditional inference to unconditional ones
- Lifted Bayesian filtering in multiset rewriting systems
- A Fourier-theoretic approach for inferring symmetries
This page was built for publication: Fourier theoretic probabilistic inference over permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880918)
