Generating Uniform Random Vectors

Claudio Asci ()
Additional contact information
Claudio Asci: Università degli Studi di L'Aquila

Journal of Theoretical Probability, 2001, vol. 14, issue 2, 333-356

Abstract: Abstract In this paper, we study the rate of convergence of the Markov chain X n+1=AX n +b n mod p, where A is an integer matrix with nonzero integer eigenvalues and {b n } n is a sequence of independent and identically distributed integer vectors. If λi≠±1 for all eigenvalues λi of A, then n=O((log p)2) steps are sufficient and n=O(log p) steps are necessary to have X n sampling from a nearly uniform distribution. Conversely, if A has the eigenvalue λ1=±1, and λi≠±1 for all i≠1, n=O(p2) steps are necessary and sufficient.

Keywords: finite state Markov chains; rates of convergence; congruential generators (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1011155412481 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:14:y:2001:i:2:d:10.1023_a:1011155412481

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1023/A:1011155412481

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().