@InProceedings{galanis_et_al:LIPIcs.APPROX/RANDOM.2021.36,
author = {Galanis, Andreas and Goldberg, Leslie Ann and Stewart, James},
title = {{Fast Mixing via Polymers for Random Graphs with Unbounded Degree}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
pages = {36:1--36:13},
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.36},
URN = {urn:nbn:de:0030-drops-147291},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.36},
annote = {Keywords: Markov chains, approximate counting, Potts model, expander graphs, random graphs}
}