Results 11 to 20 of about 70 (54)
The cutoff phenomenon for randomized riffle shuffles [PDF]
Random Structures & Algorithms, 2007 AbstractWe study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffled together. © 2007 Wiley Periodicals, Inc. Random Struct.
Guan-Yu Chen, Laurent Saloff-Coste
openaire +2 more sources
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
Haoyu Zhang +4 more
openaire +1 more source
On card guessing game with one time riffle shuffle and complete feedback [PDF]
Discrete Applied Mathematics, 2021 To Appear in Discrete Applied ...
openaire +2 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 ...
Choulakian, Vartan, Allard, Jacques
openaire +3 more sources
A rule of thumb for riffle shuffling
The Annals of Applied Probability, 2011 27 pages, 5 ...
Assaf, Sami +2 more
openaire +4 more sources
Universality of Cutoff for Riffle Shuffling
61 ...
Sellke, Mark, Shi, Jialu, Wang, Jiamin
openaire +2 more sources
On Card Guessing Games: Limit Law for One-Time Riffle Shuffle
The Electronic Journal of CombinatoricsWe 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
openaire +3 more sources
On card guessing games: Limit law for no feedback one-time riffle shuffle
Advances in Applied Mathematics18 ...
Markus Kuba, Alois Panholzer
openaire +3 more sources
An Application of the Whitehouse Module to Riffle Shuffles Followed by a Cut
, 2000 Very minor revisions; fix typos and add in ...
openaire +2 more sources
Card guessing after an asymmetric riffle shuffle
20 pages, 3 figures. Refernces updated.
openaire +2 more sources