Random processes of the form X_n+1=a_ n X_ n+b_ n p

DOI10.1214/AOP/1176989264MaRDI QIDQ686757zbMATH OpenOpenAlexFDO

Authors Martin V. Hildebrand

Publication date 11 October 1993

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aop/1176989264

zbMATH Keywords

Fourier transformuniform distributionconvergencerecursionupper bound lemma

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Recommendations

• scientific article; zbMATH DE number 850233
• Generating random vectors in ( Z/ p Z)^d via an affine random process
• A lower bound for the Chung-Diaconis-Graham random process
• On a lower bound for the Chung-Diaconis-Graham random process
• On the Chung-Diaconis-Graham random process

Cited in

(26)

• Random walks on rings and modules
• Moderate growth and random walk on finite groups
• Accelerating abelian random walks with hyperbolic dynamics
• A multiplicatively symmetrized version of the Chung-Diaconis-Graham random process
• Random motion on finite rings. I: commutative rings
• The coupon collector's problem revisited: asymptotics of the variance
• Generating uniform random vectors in \(\mathbb Z^k_p\): the general case
• Results related to the interactive process \(x_{n+1}=f(x_n,x_{n-1})\)
• Modular automata
• Random sequences of the form \(X_{t+1}=a_1X_t+b_t\) modulo \(n\) with dependent coefficients \(a_t, b_t\)
• Convergence of transition matrices of some Markov chains on finite abelian group to the uniform matrix
• Discrete random process stabilization
• A lower bound for the Chung-Diaconis-Graham random process
• On the multiplicative Chung-Diaconis-Graham process
• Enumeration and random walks on finite groups
• Asymptotic behavior of an affine random recursion in \(\mathbf Z_p^k\) defined by a matrix with an eigenvalue of size 1
• On discrete stochastic processes generated by deterministic sequences and multiplication machines
• Скорость сходимости к равномерному распределению в схеме авторегрессии на конечной абелевой группе
• Mixing time of the Chung-Diaconis-Graham random process
• scientific article; zbMATH DE number 850233 (Why is no real title available?)
• Cut-off phenomenon for the ax+b Markov chain over a finite field
• Local characteristics of smoothing properties of endomorphisms of finite abelian groups
• Generating random vectors in ( Z/ p Z)^d via an affine random process
• On mixing behavior of a family of random walks determined by a linear recurrence
• Random walks arising in random number generation
• On a lower bound for the Chung-Diaconis-Graham random process

This page was built for publication: Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686757)