Non-reversible Markov chain Monte Carlo for sampling of districting maps

Non-reversible Markov chain Monte Carlo for sampling of districting maps

Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-rever...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Herschlag, Gregory, Mattingly, Jonathan C, Sachs, Matthias, Wyse, Evan
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Probability
Statistics - Computation
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Herschlag, Gregory
Mattingly, Jonathan C
Sachs, Matthias
Wyse, Evan
description Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-reversible Markov chain Monte-Carlo (MCMC) methods for the sampling of such districting plans which have improved mixing properties in comparison to previously used (reversible) MCMC algorithms. In doing so we extend the current framework for construction of non-reversible Markov chains on discrete sampling spaces by considering a generalization of skew detailed balance. We provide a detailed description of the proposed algorithms and evaluate their performance in numerical experiments.
doi_str_mv 10.48550/arxiv.2008.07843
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2008_07843</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2008_07843</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-381fd06a8e29de3ebf7234454cf99f221881275b647d89a35c2eafca60d294ce3</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvDKhwAUz4BhIc_8T2iCKgSC0s3aMv9mewSOLIjiK4e9TCdPQuR3oIuWtYLY1S7AHyd9xqzpipmTZSXJP9W5qrjBvmEocR6RHyV9qo-4Q402OaV6Qd5DHRkDItMC1jnD9oCtTHsubo1nNOsJQbchVgLHj7vztyen46dfvq8P7y2j0eKmi1qIRpgmctGOTWo8AhaC6kVNIFawPnjTEN12popfbGglCOIwQHLfPcSodiR-7_bi-UfslxgvzTn0n9hSR-AZ7VRsE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Non-reversible Markov chain Monte Carlo for sampling of districting maps</title><source>arXiv.org</source><creator>Herschlag, Gregory ; Mattingly, Jonathan C ; Sachs, Matthias ; Wyse, Evan</creator><creatorcontrib>Herschlag, Gregory ; Mattingly, Jonathan C ; Sachs, Matthias ; Wyse, Evan</creatorcontrib><description>Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-reversible Markov chain Monte-Carlo (MCMC) methods for the sampling of such districting plans which have improved mixing properties in comparison to previously used (reversible) MCMC algorithms. In doing so we extend the current framework for construction of non-reversible Markov chains on discrete sampling spaces by considering a generalization of skew detailed balance. We provide a detailed description of the proposed algorithms and evaluate their performance in numerical experiments.</description><identifier>DOI: 10.48550/arxiv.2008.07843</identifier><language>eng</language><subject>Mathematics - Probability ; Statistics - Computation</subject><creationdate>2020-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2008.07843$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2008.07843$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Herschlag, Gregory</creatorcontrib><creatorcontrib>Mattingly, Jonathan C</creatorcontrib><creatorcontrib>Sachs, Matthias</creatorcontrib><creatorcontrib>Wyse, Evan</creatorcontrib><title>Non-reversible Markov chain Monte Carlo for sampling of districting maps</title><description>Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-reversible Markov chain Monte-Carlo (MCMC) methods for the sampling of such districting plans which have improved mixing properties in comparison to previously used (reversible) MCMC algorithms. In doing so we extend the current framework for construction of non-reversible Markov chains on discrete sampling spaces by considering a generalization of skew detailed balance. We provide a detailed description of the proposed algorithms and evaluate their performance in numerical experiments.</description><subject>Mathematics - Probability</subject><subject>Statistics - Computation</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvDKhwAUz4BhIc_8T2iCKgSC0s3aMv9mewSOLIjiK4e9TCdPQuR3oIuWtYLY1S7AHyd9xqzpipmTZSXJP9W5qrjBvmEocR6RHyV9qo-4Q402OaV6Qd5DHRkDItMC1jnD9oCtTHsubo1nNOsJQbchVgLHj7vztyen46dfvq8P7y2j0eKmi1qIRpgmctGOTWo8AhaC6kVNIFawPnjTEN12popfbGglCOIwQHLfPcSodiR-7_bi-UfslxgvzTn0n9hSR-AZ7VRsE</recordid><startdate>20200818</startdate><enddate>20200818</enddate><creator>Herschlag, Gregory</creator><creator>Mattingly, Jonathan C</creator><creator>Sachs, Matthias</creator><creator>Wyse, Evan</creator><scope>AKZ</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20200818</creationdate><title>Non-reversible Markov chain Monte Carlo for sampling of districting maps</title><author>Herschlag, Gregory ; Mattingly, Jonathan C ; Sachs, Matthias ; Wyse, Evan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-381fd06a8e29de3ebf7234454cf99f221881275b647d89a35c2eafca60d294ce3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Probability</topic><topic>Statistics - Computation</topic><toplevel>online_resources</toplevel><creatorcontrib>Herschlag, Gregory</creatorcontrib><creatorcontrib>Mattingly, Jonathan C</creatorcontrib><creatorcontrib>Sachs, Matthias</creatorcontrib><creatorcontrib>Wyse, Evan</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Herschlag, Gregory</au><au>Mattingly, Jonathan C</au><au>Sachs, Matthias</au><au>Wyse, Evan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Non-reversible Markov chain Monte Carlo for sampling of districting maps</atitle><date>2020-08-18</date><risdate>2020</risdate><abstract>Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-reversible Markov chain Monte-Carlo (MCMC) methods for the sampling of such districting plans which have improved mixing properties in comparison to previously used (reversible) MCMC algorithms. In doing so we extend the current framework for construction of non-reversible Markov chains on discrete sampling spaces by considering a generalization of skew detailed balance. We provide a detailed description of the proposed algorithms and evaluate their performance in numerical experiments.</abstract><doi>10.48550/arxiv.2008.07843</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2008.07843
ispartof
issn
language eng
recordid cdi_arxiv_primary_2008_07843
source arXiv.org
subjects Mathematics - Probability
Statistics - Computation
title Non-reversible Markov chain Monte Carlo for sampling of districting maps
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T18%3A39%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Non-reversible%20Markov%20chain%20Monte%20Carlo%20for%20sampling%20of%20districting%20maps&rft.au=Herschlag,%20Gregory&rft.date=2020-08-18&rft_id=info:doi/10.48550/arxiv.2008.07843&rft_dat=%3Carxiv_GOX%3E2008_07843%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true