Generating random elements of abelian groups | Zendy

Lukács András | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Generating random elements of abelian groups

Author(s) -

Lukács András

Publication year - 2005

Publication title -

random structures and algorithms

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.314

H-Index - 69

eISSN - 1098-2418

pISSN - 1042-9832

DOI - 10.1002/rsa.20055

Subject(s) - abelian group , struct , markov chain , mathematics , mixing (physics) , set (abstract data type) , discrete mathematics , random compact set , group (periodic table) , random element , order (exchange) , rank of an abelian group , combinatorics , elementary abelian group , pure mathematics , computer science , random field , physics , statistics , quantum mechanics , finance , economics , programming language

Algorithms based on rapidly mixing Markov chains are discussed to produce nearly uniformly distributed random elements in abelian groups of finite order. Let A be an abelian group generated by set S . Then one can generate ϵ‐nearly uniform random elements of A using 4| S |log(| A |/ϵ) log(| A |) additions and the same number of random bits. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research