Parallel discrete sampling via continuous walks
From MaRDI portal
Publication:6499218
DOI10.1145/3564246.3585207MaRDI QIDQ6499218
Nima Anari, Thuy Duong Vuong, Katherine Yu, Yi-Zhi Huang, Brian Xu, Tianyu Liu
Publication date: 8 May 2024
samplingcountingparallel algorithmsdeterminantal point processesEulerian toursstochastic localizationtransport stability
Cites Work
- Unnamed Item
- Independent sets versus perfect matchings
- Random generation of combinatorial structures from a uniform distribution
- Matrix tree theorems
- Counting and sampling \(H\)-colourings
- Log concavity and concentration of Lipschitz functions on the Boolean hypercube
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme
- The complexity of counting Eulerian tours in 4-regular graphs
- Polynomials with the half-plane property and matroid theory
- Determinantal Point Processes for Machine Learning
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Negative dependence and the geometry of polynomials
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Fast Parallel Matrix Inversion Algorithms
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Transport-Entropy Inequalities and Curvature in Discrete-Space Markov Chains
- Coverings and delta-coverings
- Dimer problem in statistical mechanics-an exact result
- Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures
- Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
- Modified log-Sobolev inequalities for strong-Rayleigh measures
This page was built for publication: Parallel discrete sampling via continuous walks
