arXiv Open Access 2017

Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer

Stephen DeSalvo

Lihat Sumber

Abstrak

We demonstrate a novel approach for the random sampling of Latin squares of order~$n$ via probabilistic divide-and-conquer. The algorithm divides the entries of the table modulo powers of $2$, and samples a corresponding binary contingency table at each level. The sampling distribution is based on the Boltzmann sampling heuristic, along with probabilistic divide-and-conquer.

Topik & Kata Kunci

stat.CO

Penulis (1)

Stephen DeSalvo

Format Sitasi

APA MLA BibTeX

DeSalvo, S. (2017). Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer. https://arxiv.org/abs/1703.08627

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓