• Corpus ID: 245006264

Cutoff Phenomenon and Limiting Profile of a Random Walk on the Symmetric Group

@inproceedings{Farah2021CutoffPA,
  title={Cutoff Phenomenon and Limiting Profile of a Random Walk on the Symmetric Group},
  author={A. Farah},
  year={2021}
}
  • A. Farah
  • Published 9 December 2021
  • Mathematics
When shuffling a deck of cards, we’re often interested in in knowing the number of shuffles after which the deck is “sufficiently shuffled,” i.e. given a known starting configuration of the card deck and some probabilistic shuffling algorithm, how many times should we shuffle the deck so that the probability of any card being in any position is (almost) exactly the same? We will consider this basic shuffling algorithm: Using a deck of n cards, laid out and facing down, pick a card A uniformly… 

Figures from this paper

References

SHOWING 1-8 OF 8 REFERENCES

Limit profile for random transpositions

We present an improved version of Diaconis' upper bound lemma, which is used to compute the limiting value of the distance to stationarity. We then apply it to random transpositions studied by

Linear Representations of Finite Groups

2021

Publicado por Elsevier Espan˜a, S.L.U. Todos los derechos reservados. Introduction and objectives: The results of the 2021 Spanish catheter ablation registry are presented. Methods: Data collection

On the Representation Theory of the Symmetric Groups

We present here a new approach to the description of finite-dimensional complex irreducible representations of the symmetric groups due to A. Okounkov and A. Vershik. It gives an alternative

Asymptotic Formulaae in Combinatory Analysis

  • Proceedings of the London Mathematical Society
  • 1918