Quantum speedup for sampling random spanning trees
From MaRDI portal
Cites work
- A matrix trickle-down theorem on simplicial complexes and applications to sampling colorings
- A Randomized Rounding Approach to the Traveling Salesman Problem
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An almost-linear time algorithm for uniform random spanning tree generation
- Bayesian space-time partitioning by sampling and pruning spanning trees
- Determinant-preserving sparsification of SDDM matrices with applications to counting and sampling spanning trees
- Determinantal point processes for machine learning
- Eldan's stochastic localization and the KLS conjecture: isoperimetry, concentration and mixing
- Expanders via random spanning trees
- Fast generation of random spanning trees and the effective resistance metric
- Faster Generation of Random Spanning Trees
- Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
- Generating random combinatorial objects
- Generating random spanning trees via fast matrix multiplication
- Graph sparsification by effective resistances
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 2019633 (Why is no real title available?)
- scientific article; zbMATH DE number 3061533 (Why is no real title available?)
- scientific article; zbMATH DE number 7768377 (Why is no real title available?)
- scientific article; zbMATH DE number 7829237 (Why is no real title available?)
- scientific article; zbMATH DE number 7788432 (Why is no real title available?)
- Improved analysis of higher order random walks and applications
- Improved baselines for causal structure learning on interventional data
- Isotropy and log-concave polynomials: accelerated sampling and high-precision counting of matroid bases
- Linking and cutting spanning trees
- Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Modified log-Sobolev inequalities for strongly log-concave distributions
- Modified logarithmic Sobolev inequalities in discrete settings
- Negative dependence and the geometry of polynomials
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization
- Optimal sublinear sampling of spanning trees and determinantal point processes via average-case entropic independence
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
- Quantum Query Complexity of Some Graph Problems
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Quantum walks on graphs
- Random spanning tree
- Random spanning trees and the prediction of weighted graphs
- Random vectors in the isotropic position
- Sampling random spanning trees faster than matrix multiplication
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Two Algorithms for Unranking Arborescences
This page was built for publication: Quantum speedup for sampling random spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346443)
