Shuffling Cards and Stopping Times
From MaRDI portal
Publication:3739943
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
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
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, Cutoff phenomenon for random walks on Kneser graphs, Uniformity of the uncovered set of random walk and cutoff for lamplighter chains, Cutoff for the Ising model on the lattice, Efficient generation of random derangements with the expected distribution of cycle lengths, The cutoff phenomenon for Ehrenfest chains, Randomness of character sums modulo \(m\), On multi-dimensional hypocoercive BGK models, Random walks on Ramanujan complexes and digraphs, The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk., Separation cutoffs for random walk on irreducible representations, Cut-off and exit from metastability: Two sides of the same coin, Cutoff at the ``entropic time for sparse Markov chains, Function-specific mixing times and concentration away from equilibrium, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Choosing a random spanning subtree: A case study, Cayley graphs and complexity geometry, Limits and rates of convergence for the distribution of search cost under the move-to-front rule, Reproducing kernel orthogonal polynomials on the multinomial distribution, Strong stationary duality for discrete time Möbius monotone Markov chains on \(\mathbb{Z}_+^d\), The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise, An affine walk on the hypercube, Card shuffling and a transformation on \(S_ n\), Shuffles of trees, Orthogonal idempotents in the descent algebra of \(B_ n\) and applications, Abrupt convergence for a family of Ornstein-Uhlenbeck processes, The cut-off phenomenon for Brownian motions on compact symmetric spaces, Entropy-driven cutoff phenomena, Finding all sorting tandem duplication random loss operations, Aging of asymmetric dynamics on the random energy model, Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009)), Simple bounds on the convergence rate of an ergodic Markov chain, A comparison theorem on convergence rates of random walks on groups, Efficiency test of pseudorandom number generators using random walks, Exact solution for a class of random walk on the hypercube, A rule of thumb for riffle shuffling, The \(L^{2}\)-cutoff for reversible Markov processes, Cutoff phenomena for random walks on random regular graphs, Cutoff for the mean-field zero-range process, Card shuffling and \(P\)-partitions, Separation cut-offs for birth and death chains, Biased random-to-top shuffling, A random polynomial time algorithm for well-routing convex bodies, Cutoff for the cyclic adjacent transposition shuffle, Fast initial conditions for Glauber dynamics, Commutation relations and Markov chains, No cut-off phenomenon for the ``Insect Markov chain, A strong uniform time for random transpositions, Asymptotic behavior of an affine random recursion in \(\mathbf Z_p^k\) defined by a matrix with an eigenvalue of size 1, Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement, Exact results on the first hitting via conditional strong quasi-stationary times and applications to metastability, Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases, Random walks on a finite graph with congestion points, Comparing mixing times on sparse random graphs, Lumpings of algebraic Markov chains arise from subquotients, An interruptible algorithm for perfect sampling via Markov chains, No-feedback card guessing for dovetail shuffles, On intertwining relations between Ehrenfest, Yule and Ornstein-Uhlenbeck processes, A conversation with David J. Aldous, Cutoff for the East process, On a front evolution problem for the multidimensional East model, Applications of symmetric functions to cycle and increasing subsequence structure after shuffles, Another conversation with Persi Diaconis, Norm convergence of random walks on compact hypergroups
