Results 11 to 20 of about 216 (186)
Riffle shuffles of a deck with repeated cards [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We study the Gilbert-Shannon-Reeds model for riffle shuffles and ask 'How many times must a deck of cards be shuffled for the deck to be in close to random order?'. In 1992, Bayer and Diaconis gave a solution which gives exact and asymptotic results for all decks of practical interest, e.g. a deck of 52 cards.
Sami Assaf +2 more
core +10 more sources
A generalization of the carries process [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We consider a carries process which is a generalization of that by Holte in the sense that (i) we take various digit sets, and (ii) we also consider negative base. Our results are : (i) eigenvalues and eigenvectors of the transition probability matrices,
Takahiko Fujita +2 more
doaj +2 more sources
The Combinatorics of Biased Riffle Shuffles [PDF]
COMBINATORICA, 1998 11 ...
Jason Fulman
openaire +3 more sources
, 2018 We consider the following card guessing game with feedback, introduced in [BD92]. An initially ordered deck of cards is shuffled via one or several riffle shuffles (or more generally: one a-shuffle). The player guesses the card on top of the deck, then looks at that card. The player then guesses the next card, looks at that card etc.
Galliot, Florian
core +3 more sources
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
Riffle shuffles with biased cuts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially cut `about in half' and then riffled together. We analyze a natural variant where the initial cut is biased. Extending results of Fulman (1998), we show a sharp cutoff in separation and L-infinity distances.
Sami Assaf +2 more
openaire +5 more sources
Riffle: An Efficient Communication System With Strong Anonymity
, 2019 Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks.
Devadas, Srinivas +3 more
core +2 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
Mathematical investigations : restoring order through repeated riffle shuffles
, 2021 We are all familiar with the riffle shuffle, one of the most popular ways to shuffle cards. To perform this shuffle, divide the deck into two halves, riffle them together with your thumb, interlocking them, and then push the halves ...
Narasimhan, Keshav Lakshmi
core
Reciprocal control of viral infection and phosphoinositide dynamics
FEBS Letters, EarlyView.Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source