Please use this identifier to cite or link to this item:
|Title:||Lifting Markov chains to random walks on groups||Authors:||Chan, O.
|Issue Date:||May-2005||Citation:||Chan, O., Lam, T.K. (2005-05). Lifting Markov chains to random walks on groups. Combinatorics Probability and Computing 14 (3) : 269-273. ScholarBank@NUS Repository. https://doi.org/10.1017/S0963548304006352||Abstract:||The determination of a Markov chain which can be lifted to a random walk on an abelian group or a group whose probability measure is a class function, is described. The analysis is facilitated whenever the probability measure on the group is a class function. A special case is that of an abelian group where any probability measure is a class function. The results show that the Fourier analysis using group representations simplifies to computations involving the irreducible characters of the group.||Source Title:||Combinatorics Probability and Computing||URI:||http://scholarbank.nus.edu.sg/handle/10635/103488||ISSN:||09635483||DOI:||10.1017/S0963548304006352|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.