Sampling random spanning arborescences in graphs with low conductance

DOI10.1016/J.SPL.2025.110481MaRDI QIDQ6880316zbMATH OpenFDO

Authors Vittorio Zampinetti, Harald Melin, Jens Lagergren

Publication date 19 December 2025

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.SPL.2025.110481

zbMATH Keywords

Bayesian inferencerandom tree samplingrandom walkWilson's algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Bayesian inference (62F15)

Cites work

• Fast generation of random spanning trees and the effective resistance metric
• Fractals in probability and analysis
• Generating random combinatorial objects
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• scientific article; zbMATH DE number 3337135 (Why is no real title available?)
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• Random forests and networks analysis
• Sampling random spanning trees faster than matrix multiplication
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Two Algorithms for Unranking Arborescences
• VICTree -- a variational inference method for clonal tree reconstruction

This page was built for publication: Sampling random spanning arborescences in graphs with low conductance

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