Products of random walks on finite groups with moderate growth
نویسندگان
چکیده
منابع مشابه
Random Walks on Finite Groups
Markov chains on finite sets are used in a great variety of situations to approximate, understand and sample from their limit distribution. A familiar example is provided by card shuffling methods. From this viewpoint, one is interested in the “mixing time” of the chain, that is, the time at which the chain gives a good approximation of the limit distribution. A remarkable phenomenon known as t...
متن کاملRandom Walks on Finite Groups with Few Random Generators
Let G be a finite group. Choose a set S of size k uniformly from G and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of S given k = 2 a log2 |G|, a > 1, this walk mixes in under m = 2a log a a−1 log |G| steps. A similar result was obtained earlier by Alon and Roichman (see [AR]), Dou and Hildebrand (see [DH]) using a different techniques. We ...
متن کاملRandom walks on finite rank solvable groups
Abstract. We establish the lower bound p2t(e, e) exp(−t1/3), for the large times asymptotic behaviours of the probabilities p2t(e, e) of return to the origin at even times 2t, for random walks associated with finite symmetric generating sets of solvable groups of finite Prüfer rank. (A group has finite Prüfer rank if there is an integer r , such that any of its finitely generated subgroup admit...
متن کاملRandom Walks on Finite Quantum Groups
1 Markov chains and random walks in classical probability . . 3 2 Quantum Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 Random walks on comodule algebras . . . . . . . . . . . . . . . . . . . . . . 7 4 Random walks on finite quantum groups . . . . . . . . . . . . . . . . . . 11 5 Spatial Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملRandom Lazy Random Walks on Arbitrary Finite Groups
This paper considers \lazy" random walks supported on a random subset of k elements of a nite group G with order n. If k = dalog 2 ne where a > 1 is constant, then most such walks take no more than a multiple of log 2 n steps to get close to uniformly distributed on G. If k = log 2 n + f (n) where f (n) ! 1 and f (n)= log 2 n ! 0 as n ! 1, then most such walks take no more than a multiple of (l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tohoku Mathematical Journal
سال: 2019
ISSN: 0040-8735
DOI: 10.2748/tmj/1561082599