Asymptotic behavior of an affine random recursion in \(\mathbf Z_p^k\) defined by a matrix with an eigenvalue of size 1
From MaRDI portal
Publication:1026342
DOI10.1016/J.SPL.2009.02.014zbMath1171.65007OpenAlexW2072263587MaRDI QIDQ1026342
Publication date: 24 June 2009
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2009.02.014
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)
- Generating uniform random vectors in \(\mathbb Z^k_p\): the general case
- Generating random vectors in \((\mathbb Z/ p \mathbb Z)^d\) via an affine random process
- Random walks arising in random number generation
- Shuffling Cards and Stopping Times
- Convergence Rates for Markov Chains
- Generating uniform random vectors
This page was built for publication: Asymptotic behavior of an affine random recursion in \(\mathbf Z_p^k\) defined by a matrix with an eigenvalue of size 1