Shuffling Cards and Stopping Times

DOI10.2307/2323590zbMath0603.60006OpenAlexW2074599161WikidataQ56058878 ScholiaQ56058878MaRDI QIDQ3739943

David J. Aldous, Persi Diaconis

Publication date: 1986

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4858822d60e1e2c81ab71faaadf5c9beb896e29e

zbMATH Keywords

stopping timeshufflingrandom shuffle

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Stopping times; optimal stopping problems; gambling theory (60G40) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (only showing first 100 items - show all)

Antiduality and Möbius monotonicity: generalized coupon collector problem ⋮ Remarks on the shuffling problem for finite groups ⋮ No cutoff for circulants: an elementary proof ⋮ Convergence of some time inhomogeneous Markov chains via spectral techniques ⋮ Abrupt convergence and escape behavior for birth and death chains ⋮ Derandomized constructions of \(k\)-wise (almost) independent permutations ⋮ Length of clustering algorithms based on random walks with an application to neuroscience ⋮ Total variation cutoff for the flip-transpose top with random shuffle ⋮ Analysis of Top To Random Shuffles ⋮ Thermalisation for small random perturbations of dynamical systems ⋮ Mixing time and cutoff for the weakly asymmetric simple exclusion process ⋮ Linear algebra and multivariate analysis in statistics: development and interconnections in the twentieth century ⋮ Mixing properties of stochastic quantum Hamiltonians ⋮ Shuffling matrices, Kronecker product and discrete Fourier transform ⋮ Random walk on sparse random digraphs ⋮ Complete edge-colored permutation graphs ⋮ CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ Top to random shuffles on colored permutations ⋮ The cutoff phenomenon for the stochastic heat and wave equation subject to small Lévy noise ⋮ Cutoff phenomenon for the warp-transpose top with random shuffle ⋮ Universal cutoff for Dyson Ornstein Uhlenbeck process ⋮ Mixing of the averaging process and its discrete dual on finite-dimensional geometries ⋮ Derivation of wealth distributions from biased exchange of money ⋮ On card guessing games: limit law for no feedback one-time riffle shuffle ⋮ Mixing with piecewise isometries on a hemispherical shell ⋮ Random walks on the circle and Diophantine approximation ⋮ Geometry of random Cayley graphs of abelian groups ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ Algebraic structures underlying quantum independences: theory and applications ⋮ Cutoff profile of the metropolis biased card shuffling ⋮ Cutoff for the Glauber dynamics of the lattice free field ⋮ Cutoff for the non reversible SSEP with reservoirs ⋮ Mixing Rates for a Random Walk on the Cube ⋮ Orthogonal intertwiners for infinite particle systems in the continuum ⋮ Gibbs sampling, conjugate priors and coupling ⋮ The cutoff phenomenon for random birth and death chains ⋮ Unnamed Item ⋮ Modelling bursty time series ⋮ Skip-free Markov chains ⋮ Descent-inversion statistics in riffle shuffles ⋮ Randomized stopping times and coherent multiperiod risk measures ⋮ Observations on the generation of permutations from random sequences ⋮ Cut-off for large sums of graphs ⋮ Cutoff for General Spin Systems with Arbitrary Boundary Conditions ⋮ Cutoff for the Fredrickson-Andersen one spin facilitated model ⋮ Mixing times of the biased card shuffling and the asymmetric exclusion process ⋮ Riffle shuffles of decks with repeated cards ⋮ Delayed path coupling and generating random permutations ⋮ The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms ⋮ Mixing time and local exponential ergodicity of the east-like process in \(\mathbb{Z}^d\) ⋮ An exposition to information percolation for the Ising model ⋮ Information percolation and cutoff for the stochastic Ising model ⋮ CARD SHUFFLING FOR YOU AND ME ⋮ Mixing Time of Random Walk on Poisson Geometry Small World ⋮ A non-local random walk on the hypercube ⋮ Topics in Markov chains: mixing and escape rate ⋮ Enumeration and random walks on finite groups ⋮ On random random walks ⋮ Examples for the Theory of Strong Stationary Duality with Countable State Spaces ⋮ Time to Stationarity for a Continuous-Time Markov Chain ⋮ Cut-off Phenomenon for Converging Processes in the Sense of α-Divergence Measures ⋮ Convergence time to the Ewens sampling formula in the infinite alleles Moran model ⋮ Universality of cutoff for graphs with an added random matching ⋮ Cutoff for random lifts of weighted graphs ⋮ Moderate growth and random walk on finite groups ⋮ Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance ⋮ A super-class walk on upper-triangular matrices ⋮ Abrupt convergence for stochastic small perturbations of one dimensional dynamical systems ⋮ Conditioned, quasi-stationary, restricted measures and escape from metastable states ⋮ Online card games ⋮ Random walks supported on random points of \(Z/nZ\) ⋮ No cutoff in spherically symmetric trees ⋮ Strong memoryless times and rare events in Markov renewal point processes. ⋮ Future independent times and Markov chains ⋮ The nearest neighbor random walk on subspaces of a vector space and rate of convergence ⋮ Generating uniform random vectors in \(\mathbb Z^k_p\): the general case ⋮ On times to quasi-stationarity for birth and death processes ⋮ Strong uniform times and finite random walks ⋮ Total variation cutoff in birth-and-death chains ⋮ Fourier transform over semi-simple algebras and harmonic analysis for probabilistic algorithms ⋮ Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables ⋮ Cut-off for \(n\)-tuples of exponentially converging processes ⋮ Cutoff on all Ramanujan graphs ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Sorting by shuffling methods and a queue ⋮ Probabilistic models of genome shuffling ⋮ Saturated chains of subsets and a random walk ⋮ Rifflescrambler -- a memory-hard password storing function ⋮ Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Randomization time for the overhand shuffle ⋮ Analysis of casino shelf shuffling machines ⋮ Testing juntas ⋮ Rates of convergence for lamplighter processes ⋮ On some variations of two-way probabilistic finite automata models ⋮ Strong stationary duality for Möbius monotone Markov chains ⋮ Measuring bias in cyclic random walks ⋮ Cut-off phenomenon for Ornstein-Uhlenbeck processes driven by Lévy processes ⋮ On the construction of measure-valued dual processes ⋮ The lumpability property for a family of Markov chains on poset block structures

This page was built for publication: Shuffling Cards and Stopping Times