Results 1 to 10 of about 75 (61)

Determinantal formula for generalized riffle shuffle [PDF]

Discrete Mathematics, 2021
We consider a generalized riffle shuffle on the colored permutation group $G_{p, n}$ and derive a determinantal formula for the probability of finding descents at given positions, proof of which is based on the bijection between the set of shuffles in question and that of non-intersecting lattice paths.
Fumihiko Nakano, Taizo Sadahiro
exaly   +4 more sources

Cutoff for the asymmetric riffle shuffle

Annals of Probability, 2022
In the Gilbert-Shannon-Reeds shuffle, a deck of $N$ cards is cut into two approximately equal parts which are then riffled uniformly at random. Bayer and Diaconis famously showed that this Markov chain undergoes cutoff in total variation after $\frac{3\log(N)}{2 \log(2)}$ shuffles.
Mark Sellke
exaly   +3 more sources

On card guessing game with one time riffle shuffle and complete feedback [PDF]

Discrete Applied Mathematics, 2021
To Appear in Discrete Applied ...
Pengda Liu
exaly   +3 more sources

Riffle [PDF]

Proceedings of the Thirteenth EuroSys Conference, 2018
The rapidly growing size of data and complexity of analytics present new challenges for large-scale data processing systems. Modern systems keep data partitions in memory for pipelined operators, and persist data across stages with wide dependencies on disks for fault tolerance. While processing can often scale well by splitting jobs into smaller tasks
Avery Ching
exaly   +2 more sources

A generalization of carries process and riffle shuffles

Discrete Mathematics, 2016
Relation to the riffle shuffle for negative base case is ...
Fumihiko Nakano, Taizo Sadahiro
exaly   +4 more sources

Uncovering and Displaying the Coherent Groups of Rank Data by Exploratory Riffle Shuffling

Open Journal of Statistics, 2021
Let n respondents rank order d items, and suppose that d << n. Our main task is to uncover and display the structure of the observed rank data by an exploratory riffle shuffling procedure which sequentially decomposes the n voters into a finite number of coherent groups plus a noisy group : where the noisy group represents the outlier voters and ...
Vartan Choulakian, Jacques Allard
exaly   +4 more sources

Cycle structure of riffle shuffles

Annals of Probability, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +4 more sources

Riffle shuffles of decks with repeated cards

Annals of Probability, 2006
Published at http://dx.doi.org/10.1214/009117905000000675 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Conger, Mark, Viswanath, D.
exaly   +4 more sources

On Card Guessing Games: Limit Law for One-Time Riffle Shuffle

Electronic Journal of Combinatorics
We consider a card guessing game with complete feedback. A ordered deck of $n$ cards labeled $1$ up to $n$ is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards, where one after another a single card is drawn from the top, and shown to the guesser until no cards remain.
Markus Kuba, Alois Panholzer
exaly   +4 more sources

On card guessing games: Limit law for no feedback one-time riffle shuffle

Advances in Applied Mathematics
18 ...
Markus Kuba, Alois Panholzer
exaly   +4 more sources