Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Konrad Anand, Andreas Göbel, Marcus Pappik, and Will Perkins. Perfect Sampling for Hard Spheres from Strong Spatial Mixing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 38:1-38:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{anand_et_al:LIPIcs.APPROX/RANDOM.2023.38, author = {Anand, Konrad and G\"{o}bel, Andreas and Pappik, Marcus and Perkins, Will}, title = {{Perfect Sampling for Hard Spheres from Strong Spatial Mixing}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {38:1--38:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.38}, URN = {urn:nbn:de:0030-drops-188638}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.38}, annote = {Keywords: perfect sampling, hard-sphere model, Gibbs point processes} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Antonio Blanca, Sarah Cannon, and Will Perkins. Fast and Perfect Sampling of Subgraphs and Polymer Systems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 4:1-4:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{blanca_et_al:LIPIcs.APPROX/RANDOM.2022.4, author = {Blanca, Antonio and Cannon, Sarah and Perkins, Will}, title = {{Fast and Perfect Sampling of Subgraphs and Polymer Systems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {4:1--4:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.4}, URN = {urn:nbn:de:0030-drops-171261}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.4}, annote = {Keywords: Random Sampling, perfect sampling, graphlets, polymer models, spin systems, percolation} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Varsha Dani, Diksha Gupta, and Thomas P. Hayes. On the Power of Choice for k-Colorability of Random Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 59:1-59:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{dani_et_al:LIPIcs.APPROX/RANDOM.2021.59, author = {Dani, Varsha and Gupta, Diksha and Hayes, Thomas P.}, title = {{On the Power of Choice for k-Colorability of Random Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {59:1--59:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.59}, URN = {urn:nbn:de:0030-drops-147527}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.59}, annote = {Keywords: Random graphs, Achlioptas Processes, Phase Transition, Graph Colorability} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Ewan Davies and Will Perkins. Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 62:1-62:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{davies_et_al:LIPIcs.ICALP.2021.62, author = {Davies, Ewan and Perkins, Will}, title = {{Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {62:1--62:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.62}, URN = {urn:nbn:de:0030-drops-141310}, doi = {10.4230/LIPIcs.ICALP.2021.62}, annote = {Keywords: approximate counting, independent sets, Markov chains} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda. Fast Algorithms at Low Temperatures via Markov Chains. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 41:1-41:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.APPROX-RANDOM.2019.41, author = {Chen, Zongchen and Galanis, Andreas and Goldberg, Leslie Ann and Perkins, Will and Stewart, James and Vigoda, Eric}, title = {{Fast Algorithms at Low Temperatures via Markov Chains}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {41:1--41:14}, 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.41}, URN = {urn:nbn:de:0030-drops-112560}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.41}, annote = {Keywords: Markov chains, approximate counting, Potts model, hard-core model, expander graphs} }
Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Amin Coja-Oghlan and Will Perkins. Belief Propagation on Replica Symmetric Random Factor Graph Models. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 27:1-27:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{cojaoghlan_et_al:LIPIcs.APPROX-RANDOM.2016.27, author = {Coja-Oghlan, Amin and Perkins, Will}, title = {{Belief Propagation on Replica Symmetric Random Factor Graph Models}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.27}, URN = {urn:nbn:de:0030-drops-66500}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.27}, annote = {Keywords: Gibbs distributions, Belief Propagation, Bethe Free Energy, Random k-SAT} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Milan Bradonjic and Will Perkins. On Sharp Thresholds in Random Geometric Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 500-514, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{bradonjic_et_al:LIPIcs.APPROX-RANDOM.2014.500, author = {Bradonjic, Milan and Perkins, Will}, title = {{On Sharp Thresholds in Random Geometric Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {500--514}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.500}, URN = {urn:nbn:de:0030-drops-47195}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.500}, annote = {Keywords: Sharp thresholds, random geometric graphs, k-SAT} }
Feedback for Dagstuhl Publishing