THE RANDOM-WALK CONSTRUCTION OF UNIFORM SPANNING-TREES AND UNIFORM LABELED TREES

被引：158

作者：

ALDOUS, DJ

机构：

来源：

关键词：

D O I：

10.1137/0403039

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：450 / 465

页数：16

共 21 条

[1] HITTING TIMES FOR RANDOM-WALKS ON VERTEX-TRANSITIVE GRAPHS [J].

ALDOUS, D .

[2]

Aldous D. J., 1989, J THEORET PROBAB, V2, P91, DOI [10.1007/BF01048272, DOI 10.1007/BF01048272]

[3] SOME INEQUALITIES FOR REVERSIBLE MARKOV-CHAINS [J].

ALDOUS, DJ .

JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1982, 25 (JUN) :564-576

[4]

ALDOUS DJ, IN PRESS ANN PROBAB

[5]

Aleliunas R., 1979, 20th Annual Symposium of Foundations of Computer Science, P218, DOI 10.1109/SFCS.1979.34

[6] A PROOF OF THE MARKOV-CHAIN TREE THEOREM [J].

ANANTHARAM, V ;

TSOUCAS, P .

[7]

Biggs N., 1974, ALGEBRAIC GRAPH THEO

[8]

Broder A.Z, 1989, J THEOR PROBAB, P101

[9]

Brouwer A.E., 1989, DISTANCE REGULAR GRA

[10]

Cvetkovic D.M., 1980, SPECTRA GRAPHS THEOR, V87