Parallel discrete sampling via continuous walks
From MaRDI portal
Cites work
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures
- Counting and sampling \(H\)-colourings
- Coverings and delta-coverings
- Determinantal point processes for machine learning
- Dimer problem in statistical mechanics-an exact result
- Fast Parallel Matrix Inversion Algorithms
- Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
- scientific article; zbMATH DE number 3068971 (Why is no real title available?)
- Independent sets versus perfect matchings
- Log concavity and concentration of Lipschitz functions on the Boolean hypercube
- Matrix tree theorems
- Modified log-Sobolev inequalities for strong-Rayleigh measures
- Negative dependence and the geometry of polynomials
- Polynomials with the half-plane property and matroid theory
- Random generation of combinatorial structures from a uniform distribution
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme
- Transport-entropy inequalities and curvature in discrete-space Markov chains
Cited in
(3)
This page was built for publication: Parallel discrete sampling via continuous walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499218)
