. It is shown that for every stationary sequence of random riffle permutations there is a natural associated dynamical system consisting of random orbits in the space of sequences from a finite alphabet. For many interesting models of card-shuffling, the associated dynamical systems have simple descriptions in terms of random or deterministic measure-preserving maps of the unit interval. It is shown that the rate of mixing for a card-shuffling process is constrained by the fiber entropy h of this map: at least (log N)=h repititions of the shuffle are needed to randomize a deck of size N , when N is large. 1. Introduction The preferred method of randomizing a deck of N cards is the riffle shuffle--cut the deck into two stacks, then riffle...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards num-bered from 1 to n and laid out in a r...
AbstractIn this paper we study random orderings of the integers with a certain invariance property. ...
1. Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a de...
A famous result of Bayer and Diaconis [2] is that the Gilbert-Shannon-Reeds (GSR) model for the riff...
This thesis considers the effect of riffle shuffling on decks of cards, allowing for some cards to b...
This paper analyzes repeated shuffling of a deck of N cards. The measure studied is a model for the...
Thorp shuffle is a simple model for a random riffle shuffle that for many years has eluded good anal...
. The p-shuffle is a natural generalization of the dovetail shuffle that is defined as follows. Firs...
The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially ...
Abstract. We present simple proofs of transience/recurrence for certain card shuing models, that is,...
The question of how many shuffles are required to randomize an initially ordered deck of cards is a ...
In this paper we study random orderings of the integers with a certain invariance property. We descr...
In the Gilbert-Shannon-Reeds shuffle, a deck of $N$ cards is cut into two approximately equal parts ...
This thesis presents mixing of a deck of cards as a random walk on the group of permutations. Perfec...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards num-bered from 1 to n and laid out in a r...
AbstractIn this paper we study random orderings of the integers with a certain invariance property. ...
1. Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a de...
A famous result of Bayer and Diaconis [2] is that the Gilbert-Shannon-Reeds (GSR) model for the riff...
This thesis considers the effect of riffle shuffling on decks of cards, allowing for some cards to b...
This paper analyzes repeated shuffling of a deck of N cards. The measure studied is a model for the...
Thorp shuffle is a simple model for a random riffle shuffle that for many years has eluded good anal...
. The p-shuffle is a natural generalization of the dovetail shuffle that is defined as follows. Firs...
The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially ...
Abstract. We present simple proofs of transience/recurrence for certain card shuing models, that is,...
The question of how many shuffles are required to randomize an initially ordered deck of cards is a ...
In this paper we study random orderings of the integers with a certain invariance property. We descr...
In the Gilbert-Shannon-Reeds shuffle, a deck of $N$ cards is cut into two approximately equal parts ...
This thesis presents mixing of a deck of cards as a random walk on the group of permutations. Perfec...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards num-bered from 1 to n and laid out in a r...
AbstractIn this paper we study random orderings of the integers with a certain invariance property. ...