Abstract
let a “random walker” loose in your universe to collect samples as they explore. The mathematical framework for this is called Markov chains. This chapter is the place where we dig into Markov chains and MCMC: the motivation, the theory, and the application to redistricting.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this chapter
Cite this chapter
DeFord, D., Duchin, M. (2022). Random walks and the universe of districting plans. In: Duchin, M., Walch, O. (eds) Political Geometry. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-69161-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-69161-9_17
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-69160-2
Online ISBN: 978-3-319-69161-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)