On transience of card shuffling

被引：6

作者：

Brofferio, S

Woess, W

机构：

[1] Univ Paris 06, Probabil Lab, F-75252 Paris, France

[2] Univ Milano Bicocca, Dipartimento Matemat & Applicaz, I-20126 Milan, Italy

来源：

关键词：

infinite permutation group; random walk; transience; recurrence;

D O I：

10.1090/S0002-9939-00-05632-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We present simple proofs of transience/recurrence for certain card shuffling models, that is, random walks on the infinite symmetric group.

引用

页码：1513 / 1519

页数：7

共 8 条

[1] ON RECURRENCE OF A CERTAIN CHAIN [J].

DARLING, DA ;

ERDOS, P .

[2] COMPARISON TECHNIQUES FOR RANDOM-WALK ON FINITE-GROUPS [J].

DIACONIS, P ;

SALOFFCOSTE, L .

[3]

FLATTO L, 1974, ILLINOIS J MATH, V18, P1

[4] A SIMPLE CRITERION FOR TRANSIENCE OF A REVERSIBLE MARKOV-CHAIN [J].

LYONS, T .

[5]

Nash-Williams C. St. J. A., 1959, MATH P CAMBRIDGE PHI, V55, P181, DOI [10.1017/S0305004100033879, DOI 10.1017/S0305004100033879]

WOESS, W .

[7]

Yamasaki M., 1979, MEM FAC LIT SCI SHIM, V13, P31

[8]

[No title captured], DOI 10.1017/S096354830000153X