Random walks and the universe of districting plans

Daryl DeFord and Moon Duchin
Additional contact information
Daryl DeFord: Washington State University
Moon Duchin: Tufts University, Department of Mathematics

A chapter in Political Geometry, 2022, pp 341-381 from Springer

Abstract: 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.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-69161-9_17

Ordering information: This item can be ordered from
http://www.springer.com/9783319691619

DOI: 10.1007/978-3-319-69161-9_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().