Non-uniform random spanning trees on weighted graphs

DOI10.1016/S0304-3975(98)00325-9MaRDI QIDQ1292296zbMATH OpenFDO

Authors K. Appert

Publication date 21 June 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

random walksundirected graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An almost-linear time algorithm for uniform random spanning tree generation
• Tree and forest weights and their application to nonuniform random graphs
• scientific article; zbMATH DE number 953290
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1107737 (Why is no real title available?)
• scientific article; zbMATH DE number 871943 (Why is no real title available?)
• On a random walk problem arising in self-stabilizing token management
• Random walks and the effective resistance of networks
• Random walks on weighted graphs and applications to on-line algorithms
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

Cited in

(10)

• A reverse Aldous-Broder algorithm
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Spanning trees and random walks on weighted graphs
• Spectral Clustering, Bayesian Spanning Forest, and Forest Process
• Random spanning trees and the prediction of weighted graphs
• Weights of uniform spanning forests on nonunimodular transitive graphs
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Random forests and networks analysis
• Perfect sampling methods for random forests
• An almost-linear time algorithm for uniform random spanning tree generation

This page was built for publication: Non-uniform random spanning trees on weighted graphs

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