Related papers: Shuffling cards by spatial motion
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
Consider a uniformly random deck consisting of cards labelled by numbers from $1$ through $n$, possibly with repeats. A guesser guesses the top card, after which it is revealed and removed and the game continues. What is the expected number…
A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…
Spatial diffusion of particles in periodic potential models has provided a good framework for studying the role of chaos in global properties of classical systems. Here a bidimensional "soft" billiard, classically modeled from an optical…
The smoothing distribution is the conditional distribution of the diffusion process in the space of trajectories given noisy observations made continuously in time. It is generally difficult to sample from this distribution. We use the…
We introduce a non-diffusive spatial coupling term into the replicator equation of evolutionary game theory. The spatial flux is based on motion due to local gradients in the relative fitness of each strategy, providing a game-dependent…
The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from…
In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…
Graph Laplacians and related nonlinear mappings into low dimensional spaces have been shown to be powerful tools for organizing high dimensional data. Here we consider a data set X in which the graph associated with it changes depending on…
Analytically tractable dynamical systems exhibiting a whole range of normal and anomalous deterministic diffusion are rare. Here we introduce a simple non-chaotic model in terms of an interval exchange transformation suitably lifted onto…
Consider a real hyperplane arrangement and let $\mathcal{C}$ denote the occurring chambers. Bidigare, Hanlon and Rockmore introduced a Markov chain on $\mathcal{C}$ which is a generalization of some card shuffling models used in computer…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
E. Thorp introduced the following card shuffling model. Suppose the number of cards $n$ is even. Cut the deck into two equal piles. Drop the first card from the left pile or from the right pile according to the outcome of a fair coin flip.…
A non--linear diffusion equation is derived by taking into account hopping rates depending on the occupation of next neighbouring sites. There appears additonal repulsive and attractive forces leading to a changed local mobiltiy. The…
We provide a coupling proof that the transposition shuffle on a deck of n cards is mixing of rate Cn(log{n}) with a moderate constant, C. This rate was determined by Diaconis and Shahshahani, but the question of a natural probabilistic…
We consider the vertical motion of a free falling ball bouncing elastically on a racket moving in the vertical direction according to a regular periodic function $f$. We give a sufficient condition on the second derivative of $f$ giving…
We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on…
We consider a processor sharing queue where the number of jobs served at any time is limited to $K$, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this…
A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…
We consider a random billiard map, the one in which the standard specular reflection rule is replaced by a random reflection given by a Markov operator. We exhibit an invariant measure for random billiards on general tables. In the special…