Exact sampling of spanning trees via fast-forwarded random walks
From MaRDI portal
Cites work
- A Bayesian CART algorithm
- A Bayesian survival treed hazards model using latent Gaussian processes
- A combinatorial proof of Aldous–Broder theorem for general Markov chains
- A Nonstationary Soft Partitioned Gaussian Process Model via Random Spanning Trees
- A note on the last new vertex visited by a random walk
- A Quantitative Study of Gene Regulation Involved in the Immune Response of Anopheline Mosquitoes
- A tensor-EM method for large-scale latent class analysis with binary responses
- An almost-linear time algorithm for uniform random spanning tree generation
- BART: Bayesian additive regression trees
- Bayesian regression tree ensembles that adapt to smoothness and sparsity
- Bayesian space-time partitioning by sampling and pruning spanning trees
- Bayesian treed Gaussian process models with an application to computer modeling
- Bounds on the cover time
- Covering problems for Markov chains
- Fast generation of random spanning trees and the effective resistance metric
- Generating random combinatorial objects
- Generating random spanning trees via fast matrix multiplication
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 7370554 (Why is no real title available?)
- Improved criteria for clustering based on the posterior similarity matrix
- Laplacians and the Cheeger inequality for directed graphs
- Learning with mixtures of trees.
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Matrix Analysis and Applied Linear Algebra, Second Edition
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees
- Random spanning tree
- Spectral Clustering, Bayesian Spanning Forest, and Forest Process
- Subtree prune and regraft: a reversible real tree-valued Markov process
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Uncertainty quantification for Bayesian CART
This page was built for publication: Exact sampling of spanning trees via fast-forwarded random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915807)
