Czasopismo
Tytuł artykułu
Warianty tytułu
Języki publikacji
Abstrakty
We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also yield polynomial time mixing rates for some related Markov chains on the set of forests with roots and on the set of connected spanning subgraphs. We obtain a parametric class of stationary distributions from which we can efficiently sample. For rooted forests this includes the uniform distribution. For connected spanning subgraphs the uniform distribution is not covered.
Słowa kluczowe
Kategorie tematyczne
Czasopismo
Rocznik
Tom
Numer
Strony
341-365
Opis fizyczny
Daty
wydano
2005
Twórcy
autor
- Department of Mathematics, University of Freiburg, Eckerstr. 1, 79104 Freiburg, Germany
autor
- Department of Mathematics, University of Freiburg, Eckerstr. 1, 79104 Freiburg, Germany
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
DOI
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-doi-10_4064-am32-3-7