A new algorithm estimates orbit counts by multiplying estimates of orbit-count ratios from Burnside process samples, and estimates k(U_n(F_q)) for q=2,3 up to n=32.
Inference in hidden Markov models
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Counting the number of group orbits by marrying the Burnside process with importance sampling
A new algorithm estimates orbit counts by multiplying estimates of orbit-count ratios from Burnside process samples, and estimates k(U_n(F_q)) for q=2,3 up to n=32.