New Approaches to Counting and Sampling

Informazioni relative al progetto

NACS

ID dell’accordo di sovvenzione: 947778

DOI

10.3030/947778

Data della firma CE 31 Luglio 2020

Data di avvio 1 Gennaio 2021

Data di completamento 30 Giugno 2026

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 468 303,00

Contributo UE

€ 1 468 303,00

Coordinato da

THE UNIVERSITY OF EDINBURGH
United Kingdom

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (13)

Improved Bounds for Randomly Colouring Simple Hypergraphs

Autori: Feng, Weiming; Guo, Heng; Wang, Jiaheng
Pubblicato in: International Conference on Randomization and Computation 2022, 2022
Editore: 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)

Autori: Efthymiou, Charilaos; Feng, Weiming
Pubblicato in: The 50th International Colloquium on Automata, Languages & Programming, 2023
Editore: LIPIcs
DOI: 10.48550/arxiv.2302.06172

Rapid mixing of Glauber dynamics via spectral independence for all degrees

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

An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs

Autori: Weiming Feng, Heng Guo
Pubblicato in: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), 2024
Editore: Dagstuhl Publishing
DOI: 10.4230/lipics.icalp.2024.62

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

Autori: Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
Pubblicato in: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023
Editore: SIAM
DOI: 10.1137/1.9781611977585.ch30

Extracting Mergers and Projections of Partitions

Autori: Kopparty, Swastik; N, Vishvajeet
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023), 2023
Editore: LIPIcs
DOI: 10.4230/lipics.approx/random.2023.52

Improving Certified Robustness via Statistical Learning with Logical Reasoning

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

Optimal mixing for two-state anti-ferromagnetic spin systems

Autori: Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang
Pubblicato in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Editore: IEEE
DOI: 10.1109/focs54457.2022.00062

On Deterministically Approximating Total Variation Distance

Autori: Weiming Feng, Liqiang Liu, Tianren Liu
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 1766-1791
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.70

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

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

Deterministic Approximation for the Volume of the Truncated Fractional Matching Polytope

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

Towards derandomising Markov chain Monte Carlo

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

Near-linear time samplers for matroid independent sets with applications

Autori: Xiaoyu Chen, Heng Guo, Xinyuan Zhang, Zongrui Zou
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024), 2024
Editore: 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

Autori: Weiming Feng ; Heng Guo ; Mark Jerrum ; Jiaheng Wang
Pubblicato in: TheoretiCS, Numero 2, 2023, ISSN 2751-4838
Editore: Episciences
DOI: 10.46298/theoretics.23.7

Toward Derandomizing Markov Chain Monte Carlo

Autori: Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
Pubblicato in: SIAM Journal on Computing, Numero 54, 2025, Pagina/e 775-813, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/24m1663806

Counting vertices of integral polytopes defined by facets

Autori: Heng Guo; Mark Jerrum
Pubblicato in: Discrete & computational geometry, 2022, ISSN 0179-5376
Editore: Springer Verlag
DOI: 10.1007/s00454-022-00406-8

Perfect sampling from spatial mixing

Autori: Feng, Weiming; Guo, Heng; Yin, Yitong
Pubblicato in: Random Structures and Algorithms, 2021, ISSN 1042-9832
Editore: John Wiley & Sons Inc.
DOI: 10.1002/rsa.21079

Approximate Counting for Spin Systems in Sub-Quadratic Time

Autori: Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang
Pubblicato in: TheoretiCS, Numero Volume 4, 2025, ISSN 2751-4838
Editore: TheoretiCS Foundation e.V..
DOI: 10.46298/theoretics.25.3

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

Autori: Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 38, 2024, Pagina/e 2750-2811, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m1595722

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

Autori: Feng, Weiming; Guo, Heng; Yin, Yitong; Zhang, Chihao
Pubblicato in: Journal of the ACM, 2021, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3469832

Counting Solutions to Random CNF Formulas

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

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

Autori: Jin-Yi Cai; Zhiguo Fu; Heng Guo; Tyson Williams
Pubblicato in: Theory of Computing Systems volume, 2022, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-021-10032-1

Inapproximability of counting independent sets in linear hypergraphs

Autori: Guoliang Qiu, Jiaheng Wang
Pubblicato in: Information Processing Letters, Numero 184, 2023, Pagina/e 106448, ISSN 0020-0190
Editore: Elsevier BV
DOI: 10.1016/j.ipl.2023.106448

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

Autori: Weiming Feng; Heng Guo; Jiaheng Wang
Pubblicato in: Information and Computation, 2023, Pagina/e 105066:1-34, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2023.105066

Inapproximability of Counting Hypergraph Colourings

Autori: Andreas Galanis, Heng Guo, Jiaheng Wang
Pubblicato in: ACM Trans. Comput. Theory, 2023, ISSN 1942-3454
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3558554

Rapid Mixing from Spectral Independence beyond the Boolean Domain

Autori: Feng, Weiming; Guo, Heng; Yin, Yitong; Zhang, Chihao
Pubblicato in: ACM Transactions on Algorithms, 2022, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3531008