scientific article; zbMATH DE number 7768377

DOI10.4230/LIPICS.APPROX/RANDOM.2021.32MaRDI QIDQ6090907zbMATH OpenFDO

Authors Kuikui Liu

Publication date 20 November 2023

Full work available at URL https://arxiv.org/abs/2103.11609

zbMATH Keywords

approximate countingMarkov chainsspectral independence

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(11)

• On mixing of Markov chains: coupling, spectral independence, and entropy factorization
• Spectral independence, coupling, and the spectral gap of the Glauber dynamics
• Spectral independence via stability and applications to Holant-type problems
• Expanderizing higher-order random walks
• Optimal mixing via tensorization for random independent sets on arbitrary trees
• Rapid mixing of the down-up walk on matchings of a fixed size
• Expanderizing higher-order random walks
• Localization schemes: a framework for proving mixing bounds for Markov chains
• Entropy and curvature: beyond the Peres-Tetali conjecture
• Complexity of high-dimensional identity testing with coordinate conditional sampling
• Quantum speedup for sampling random spanning trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090907)