APPROXIMATE COUNTING, UNIFORM GENERATION AND RAPIDLY MIXING MARKOV-CHAINS

被引：339

作者：

SINCLAIR, A

JERRUM, M

机构：

来源：

关键词：

D O I：

10.1016/0890-5401(89)90067-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：93 / 133

页数：41

共 39 条

[1] SHUFFLING CARDS AND STOPPING-TIMES [J].

ALDOUS, D ;

DIACONIS, P .

[2] STRONG UNIFORM TIMES AND FINITE RANDOM-WALKS [J].

ALDOUS, D ;

DIACONIS, P .

[3]

ALDOUS D, 1987, PROBAB ENG INFORM SC, V1, P33

[4]

ALDOUS D, 1981, LECT NOTES MATH, V986, P243

ALON, N ;

MILMAN, VD .

[6] EIGENVALUES AND EXPANDERS [J].

ALON, N .

[7]

[Anonymous], PHASE TRANSITIONS CR

[8]

BACH E, 1983, 15TH P ANN ACM S THE, P184

[9]

Bollobas B, 1980, EUR J COMBINAT, V1, P311

[10]

Bollobas B., 1985, RANDOM GRAPHS