Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Card Shuffling"”.

  1. Markov Chains, Random Walks, and Card Shuffling

    … in the study of random processes pertains to card shuffling. Whether or not a deck of cards is random can have huge implications on any game being played with those particular cards. This thesis explores the question of randomness by using techniques established through analysis of Markov …

    ecu Repository record for Markov Chains, Random Walks, and Card Shuffling (opens in a new tab)

  2. Markov chain mixting time, card shuffling and spin systems dynamics

    … at examples. We focus on various models of card shuffling (random walk on the permutation group $S_n$) and the Swendsen-Wang dynamics of the mean-field Ising Model. We show that the Card-Cyclic to Random shuffle has mixing time of order $\Theta(n \log n)$ (joint work of Ben Morris and Yuval …

    washington Repository record for Markov chain mixting time, card shuffling and spin systems dynamics (opens in a new tab)

  3. Transition shuffling and linear switching systems

    … which addressed a simple kind of shuffling, top-in shuffle. In this dissertation I will use linear switching systems and Markov chains theory, focusing on another type of shuffling, transposition shuffle. In the early twentieth century, Markov, Poincare, and Borel discussed the …

    ttu Repository record for Transition shuffling and linear switching systems (opens in a new tab)

  4. Random walks on a finite group

    … of random walks on finite groups associated with card shuffling, the underlying group in this discussion is the symmetric group. Consider, for example, the shuffling method used by good card players called riffle shuffling, a subject to which Persi Diaconis gives a marvelous introduction in [1]. …

    ttu Repository record for Random walks on a finite group (opens in a new tab)

  5. Markov chains at the interface of combinatorics, computing, and statistical physics

    … to a simplified version of this biased card-shuffling. We provide new connections between M_nn and M_mon by using simple combinatorial bijections, and we prove that M_nn is always rapidly mixing for two general classes of positively biased {p_{xy}}. More significantly, we also prove that …

    gatech Repository record for Markov chains at the interface of combinatorics, computing, and statistical physics (opens in a new tab)

  6. Security of Lightweight Cryptographic Primitives

    … for binary PRNGs to non-binary uses like card shuffling in a casino. This thesis explores a shuffler algorithm that utilizes RNS in Fisher-Yates shuffles, and that calls for inputs from any PRNG. Entropy is lost through this algorithm by the use of PRNG in lieu of TRNG and by its RNS …

    vt Repository record for Security of Lightweight Cryptographic Primitives (opens in a new tab)

  7. Estimating Mixing Times: Techniques and Applications

    How many times do you have to shuffle a deck of n cards before it is close to random? log n? n? n^3? Similar convergence rate questions for finite Markov chains are central to solving applied problems in diverse fields including physics, computer science and biology. This thesis investigates two …

    cornell Repository record for Estimating Mixing Times: Techniques and Applications (opens in a new tab)

  8. Aspects of combinatorial probability

    This dissertation contains the accumulation of five works in combinatorial probability, each with underlying connections to statistical physics. Central themes unifying these projects are in the analysis of stochastic processes for sampling combinatorial objects, and modeling combinatorially …

    texas Repository record for Aspects of combinatorial probability (opens in a new tab)