Random shuffles and group representations (Q1058225): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Leopold Flatto / rank | |||
Property / author | |||
Property / author: Q182658 / rank | |||
Property / author | |||
Property / author: Q798709 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ulrich Krengel / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q101004836 / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Leopold Flatto / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Andrew M. Odlyzko / rank | |||
Normal rank | |||
Property / author | |||
Property / author: David B. Wales / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ulrich Krengel / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1214/aop/1176993073 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2058006306 / rank | |||
Normal rank |
Latest revision as of 23:53, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random shuffles and group representations |
scientific article |
Statements
Random shuffles and group representations (English)
0 references
1985
0 references
The authors consider random walks on a finite group G with a uniform initial distribution, and ask for the distribution of the number T of steps it takes to reach a particular element of G, which may be assumed to be the unit of G. They obtain a formula for the generating function of T, involving the irreducible representations of G. These problems were motivated by questions on card shuffling. If one starts with a deck of n cards in random order and reshuffles it by choosing two cards at random and interchanging them, how long does it take that the deck is fully sorted? It turns out that the expected number of shuffles is \(n!+2(n-2)!+o((n-2)!)\). The paper also studies limit laws for T and other related results.
0 references
random walks on a finite group
0 references
card shuffling
0 references