Non-uniform random spanning trees on weighted graphs

DOI10.1016/S0304-3975(98)00325-9zbMATH Open0916.68107MaRDI QIDQ1292296FDOQ1292296

K. Appert

Publication date: 21 June 1999

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

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

zbMATH Keywords

random walksundirected graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Random walks on weighted graphs and applications to on-line algorithms
• Title not available (Why is that?)
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• On a random walk problem arising in self-stabilizing token management
• Random walks and the effective resistance of networks
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Spectral Clustering, Bayesian Spanning Forest, and Forest Process
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Weights of uniform spanning forests on nonunimodular transitive graphs
• GETGRATS
• Perfect sampling methods for random forests

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)