Markov Chain Analysis of Musical Dice Games
J.R. Dawin, D. Volchenkov

TL;DR
This paper analyzes musical compositions using Markov chains, focusing on entropy, redundancy, and first passage times to understand tonal structure and composer differences, and introduces a Riemannian distance for musical dice games.
Contribution
It applies Markov chain analysis to a large dataset of musical pieces, introducing a geodesic distance based on Riemannian structure to compare musical dice games.
Findings
Entropy exceeds redundancy in tonal music.
First passage times reveal tonality and composer.
Riemannian distance measures differences in musical dice games.
Abstract
We have studied entropy, redundancy, complexity, and first passage times to notes for 804 pieces of 29 composers. The successful understanding of tonal music calls for an experienced listener, as entropy dominates over redundancy in musical messages. First passage times to notes resolve tonality and feature a composer. We also discuss the possible distances in space of musical dice games and introduced the geodesic distance based on the Riemann structure associated to the probability vectors (rows of the transition matrices).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMusic Technology and Sound Studies · Music and Audio Processing · Neuroscience and Music Perception
