Analysis of top to bottom-\(k\) shuffles (Q2494572): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102283928 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0603209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3660628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Top To Random Shuffles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison techniques for random walk on finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4213305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a random permutation with random transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric bounds for eigenvalues of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Behavior of the Solutions of a Class of Differential-Difference Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased random-to-top shuffling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local limit theorem for a family of non-reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time of the Rudvalis shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times of lozenge tiling and card shuffling Markov chains / rank
 
Normal rank

Latest revision as of 16:33, 24 June 2024

scientific article
Language Label Description Also known as
English
Analysis of top to bottom-\(k\) shuffles
scientific article

    Statements

    Analysis of top to bottom-\(k\) shuffles (English)
    0 references
    0 references
    29 June 2006
    0 references
    The aim of this paper is to analyze a class of walks that generalizes the top to random chain, namely, top to bottom-\(k\) shuffles. These shuffles are generated by moving the top card uniformly at random to any of the bottom \(k_n\) positions of the deck. The author gives upper and lower bounds on the total variation mixing time for this shuffle as \(k_n\) ranges from a constant to \(n\). He also considers a symmetric variant of this shuffle in which at each step either the top card is randomly inserted into the bottom \(k_n\) positions or a random card from the bottom \(k_n\) positions is moved to the top. For this reversible shuffle the author derives bounds on the \(L^2\) mixing time. Finally, he transfers mixing time estimates for the above shuffles to the lazy top to bottom-\(k\) walks that move with probability 1/2 at each step.
    0 references
    finite Markov chains
    0 references
    mixing time
    0 references
    card shuffing
    0 references
    Rudvalis shuffle
    0 references

    Identifiers