scientific article
From MaRDI portal
zbMath0514.60067MaRDI QIDQ3660628
Publication date: 1983
Full work available at URL: http://www.numdam.org/item?id=SPS_1983__17__243_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sums of independent random variables; random walks (60G50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Related Items
Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem, Mixing times of Markov chains for self‐organizing lists and biased 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, Derivation of wealth distributions from biased exchange of money, Mixing time for the asymmetric simple exclusion process in a random environment, Random walks on the circle and Diophantine approximation, Cutoff profile of the metropolis biased card shuffling, Cutoff for the Glauber dynamics of the lattice free field, Interactions of computational complexity theory and mathematics, Optimal coupling of jumpy Brownian motion on the circle, Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations, Unnamed Item, Unnamed Item, Unnamed Item, Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems, The hit-and-run version of top-to-random, Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread, Cutoff for random lifts of weighted graphs, A note on various holding probabilities for random lazy random walks on finite groups, On the rate of mixing for \(p\)-shuffles., On the approximation of one Markov chain by another, Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance, Perfect sampling using bounding chains., Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion, An adjacent-swap Markov chain on coalescent trees, Cutoff profile of ASEP on a segment, Strong uniform times and finite random walks, Total variation cutoff in birth-and-death chains, A note on adiabatic theorem for Markov chains, Abrupt convergence and escape behavior for birth and death chains, Cutoff on all Ramanujan graphs, Coupling with the stationary distribution and improved sampling for colorings and independent sets, On coupling and the approximation of the permanent, Cutoff on Ramanujan complexes and classical groups, Approximate counting, uniform generation and rapidly mixing Markov chains, Randomization time for the overhand shuffle, A threshold for cutoff in two-community random graphs, Analysis of casino shelf shuffling machines, Linear algebra and multivariate analysis in statistics: development and interconnections in the twentieth century, A rapidly mixing stochastic system of finite interacting particles on the circle, Cutoff for the mean-field zero-range process with bounded monotone rates, Random walk on sparse random digraphs, Tweakable Blockciphers with Asymptotically Optimal Security, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS, Large deviations for the interchange process on the interval and incompressible flows, Uniformity of the uncovered set of random walk and cutoff for lamplighter chains, Cutoff for permuted Markov chains, Cutoff for the Ising model on the lattice, Mixing time for the Ising model: a uniform lower bound for all graphs, Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher, Mixing time for the solid-on-solid model, Fast uniform generation of regular graphs, The cutoff phenomenon for Ehrenfest chains, MEXIT: maximal un-coupling times for stochastic processes, Random walks on Ramanujan complexes and digraphs, Mixing times for random \(k\)-cycles and coalescence-fragmentation chains, Optimal Co-Adapted Coupling for the Symmetric Random Walk on the Hypercube, Numerical computations of geometric ergodicity for stochastic dynamics, Mixing times of lozenge tiling and card shuffling Markov chains, 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, Meeting times for independent Markov chains, A general lower bound for mixing of single-site dynamics on graphs, Path coupling without contraction, Cutoff for conjugacy-invariant random walks on the permutation group, Faithful couplings of Markov chains: Now equals forever, Optimal Coadapted Coupling for a Random Walk on the Hyper-Complete Graph, The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise, Coupling of Brownian motions in Banach spaces, Mixing of the exclusion process with small bias, An affine walk on the hypercube, Coupling polynomial Stratonovich integrals: the two-dimensional Brownian case, Random sampling of colourings of sparse random graphs with a constant number of colours, Convergence rates of random walk on irreducible representations of finite groups, Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities, Simple bounds on the convergence rate of an ergodic Markov chain, Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables, A rule of thumb for riffle shuffling, Random multiplicative walks on the residues modulo n, Sharp thresholds for Hamiltonicity in random intersection graphs, Analysis of top to bottom-\(k\) shuffles, The overhand shuffle mixes in \(\Theta(n^2\log n)\) steps, The \(L^{2}\)-cutoff for reversible Markov processes, Cutoff phenomena for random walks on random regular graphs, A unified approach to coupling SDEs driven by Lévy noise and some applications, Functions of random walks on hyperplane arrangements, Cutoff for the mean-field zero-range process, Separation cut-offs for birth and death chains, Information percolation and cutoff for the stochastic Ising model, Provable unlinkability against traffic analysis with low message overhead, Convergence rates of Markov chains for some self-assembly and non-saturated Ising models, Rapid mixing for lattice colourings with fewer colours, Fast initial conditions for Glauber dynamics, A strong uniform time for random transpositions, Relaxation of product Markov chains on product spaces, Sampling Eulerian orientations of triangular lattice graphs, Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement, A non-local random walk on the hypercube, Sampling biased monotonic surfaces using exponential metrics, Limit profiles for reversible Markov chains, Comparing mixing times on sparse random graphs, Deterministic counting of graph colourings using sequences of subgraphs, Radiocoloring in planar graphs: Complexity and approximations, Mixing time of fractional random walk on finite fields, No-feedback card guessing for dovetail shuffles, Polynomial-time counting and sampling of two-rowed contingency tables, Cutoff for the asymmetric riffle shuffle, Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting, Faster random generation of linear extensions, Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs, A conversation with David J. Aldous, Cutoff for the East process, Unnamed Item, On the time taken by random walks on finite groups to visit every state, Another conversation with Persi Diaconis
