New Approaches to Counting and Sampling

Información del proyecto

NACS

Identificador del acuerdo de subvención: 947778

DOI

10.3030/947778

Fecha de la firma de la CE 31 Julio 2020

Fecha de inicio 1 Enero 2021

Fecha de finalización 30 Junio 2026

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 468 303,00

Aportación de la UE

€ 1 468 303,00

Coordinado por

THE UNIVERSITY OF EDINBURGH
United Kingdom

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Conference proceedings (13)

Improved Bounds for Randomly Colouring Simple Hypergraphs

Autores: Feng, Weiming; Guo, Heng; Wang, Jiaheng
Publicado en: International Conference on Randomization and Computation 2022, 2022
Editor: LIPIcs
DOI: 10.4230/lipics.approx/random.2022.25

On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n)

Autores: Efthymiou, Charilaos; Feng, Weiming
Publicado en: The 50th International Colloquium on Automata, Languages & Programming, 2023
Editor: LIPIcs
DOI: 10.48550/arxiv.2302.06172

Rapid mixing of Glauber dynamics via spectral independence for all degrees

Autores: Chen, Xiaoyu; Feng, Weiming; Yin, Yitong; Zhang, Xinyuan
Publicado en: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, ISBN 978-1-6654-2055-6
Editor: IEEE
DOI: 10.1109/focs52979.2021.00022

An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs

Autores: Weiming Feng, Heng Guo
Publicado en: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), 2024
Editor: Dagstuhl Publishing
DOI: 10.4230/lipics.icalp.2024.62

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

Autores: Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
Publicado en: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023
Editor: SIAM
DOI: 10.1137/1.9781611977585.ch30

Extracting Mergers and Projections of Partitions

Autores: Kopparty, Swastik; N, Vishvajeet
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023), 2023
Editor: LIPIcs
DOI: 10.4230/lipics.approx/random.2023.52

Improving Certified Robustness via Statistical Learning with Logical Reasoning

Autores: Zhuolin Yang, Zhikuan Zhao, Boxin Wang, Jiawei Zhang, Linyi Li, Hengzhi Pei, Bojan Karlas, Ji Liu, Heng Guo, Ce Zhang, Bo Li
Publicado en: Advances in Neural Information Processing Systems 35 (NeurIPS 2022), 2022
Editor: MLR press

Optimal mixing for two-state anti-ferromagnetic spin systems

Autores: Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang
Publicado en: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Editor: IEEE
DOI: 10.1109/focs54457.2022.00062

On Deterministically Approximating Total Variation Distance

Autores: Weiming Feng, Liqiang Liu, Tianren Liu
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 1766-1791
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.70

Rapid mixing of the flip chain over non-crossing spanning trees

Autores: Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
Publicado en: 41st International Symposium on Computational Geometry (SoCG 2025), 2025
Editor: Dagstuhl publishing
DOI: 10.4230/lipics.socg.2025.8

Deterministic Approximation for the Volume of the Truncated Fractional Matching Polytope

Autores: Heng Guo, Vishvajeet N
Publicado en: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 2025, ISSN 1868-8969
Editor: Dagstuhl Publishing
DOI: 10.4230/lipics.itcs.2025.57

Towards derandomising Markov chain Monte Carlo

Autores: Feng, Weiming; Guo, Heng; Wang, Chunyang; Wang, Jiaheng; Yin, Yitong
Publicado en: 64th IEEE Symposium on Foundations of Computer Science (FOCS) 2023, 2024
Editor: IEEE
DOI: 10.48550/arxiv.2211.03487

Near-linear time samplers for matroid independent sets with applications

Autores: Xiaoyu Chen, Heng Guo, Xinyuan Zhang, Zongrui Zou
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024), 2024
Editor: Dagstuhl publishing
DOI: 10.4230/lipics.approx/random.2024.32

Peer reviewed articles (13)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

Autores: Weiming Feng ; Heng Guo ; Mark Jerrum ; Jiaheng Wang
Publicado en: TheoretiCS, Edición 2, 2023, ISSN 2751-4838
Editor: Episciences
DOI: 10.46298/theoretics.23.7

Toward Derandomizing Markov Chain Monte Carlo

Autores: Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
Publicado en: SIAM Journal on Computing, Edición 54, 2025, Página(s) 775-813, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/24m1663806

Counting vertices of integral polytopes defined by facets

Autores: Heng Guo; Mark Jerrum
Publicado en: Discrete & computational geometry, 2022, ISSN 0179-5376
Editor: Springer Verlag
DOI: 10.1007/s00454-022-00406-8

Perfect sampling from spatial mixing

Autores: Feng, Weiming; Guo, Heng; Yin, Yitong
Publicado en: Random Structures and Algorithms, 2021, ISSN 1042-9832
Editor: John Wiley & Sons Inc.
DOI: 10.1002/rsa.21079

Approximate Counting for Spin Systems in Sub-Quadratic Time

Autores: Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang
Publicado en: TheoretiCS, Edición Volume 4, 2025, ISSN 2751-4838
Editor: TheoretiCS Foundation e.V..
DOI: 10.46298/theoretics.25.3

Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity

Autores: Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra
Publicado en: SIAM Journal on Discrete Mathematics, Edición 38, 2024, Página(s) 2750-2811, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m1595722

Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime

Autores: Feng, Weiming; Guo, Heng; Yin, Yitong; Zhang, Chihao
Publicado en: Journal of the ACM, 2021, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3469832

Counting Solutions to Random CNF Formulas

Autores: Andreas Galanis; Leslie Ann Goldberg; Heng Guo; Kuan Yang
Publicado en: SIAM Journal on Computing, 2021, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1351527

FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints

Autores: Jin-Yi Cai; Zhiguo Fu; Heng Guo; Tyson Williams
Publicado en: Theory of Computing Systems volume, 2022, ISSN 1432-4350
Editor: Springer Verlag
DOI: 10.1007/s00224-021-10032-1

Inapproximability of counting independent sets in linear hypergraphs

Autores: Guoliang Qiu, Jiaheng Wang
Publicado en: Information Processing Letters, Edición 184, 2023, Página(s) 106448, ISSN 0020-0190
Editor: Elsevier BV
DOI: 10.1016/j.ipl.2023.106448

Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields

Autores: Weiming Feng; Heng Guo; Jiaheng Wang
Publicado en: Information and Computation, 2023, Página(s) 105066:1-34, ISSN 0890-5401
Editor: Academic Press
DOI: 10.1016/j.ic.2023.105066

Inapproximability of Counting Hypergraph Colourings

Autores: Andreas Galanis, Heng Guo, Jiaheng Wang
Publicado en: ACM Trans. Comput. Theory, 2023, ISSN 1942-3454
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3558554

Rapid Mixing from Spectral Independence beyond the Boolean Domain

Autores: Feng, Weiming; Guo, Heng; Yin, Yitong; Zhang, Chihao
Publicado en: ACM Transactions on Algorithms, 2022, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3531008