Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Sarah Miracle, Amanda Pascoe Streib, and Noah Streib. Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 3:1-3:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{miracle_et_al:LIPIcs.APPROX/RANDOM.2020.3, author = {Miracle, Sarah and Streib, Amanda Pascoe and Streib, Noah}, title = {{Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {3:1--3:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.3}, URN = {urn:nbn:de:0030-drops-126069}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.3}, annote = {Keywords: Markov chains, Permutations, Decomposition, Spectral Gap, Iterated Decomposition} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, and Andréa W. Richa. A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 54:1-54:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cannon_et_al:LIPIcs.APPROX-RANDOM.2019.54, author = {Cannon, Sarah and Daymude, Joshua J. and G\"{o}kmen, Cem and Randall, Dana and Richa, Andr\'{e}a W.}, title = {{A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {54:1--54:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.54}, URN = {urn:nbn:de:0030-drops-112696}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.54}, annote = {Keywords: Markov chains, Programmable matter, Cluster expansion} }