Please use this identifier to cite or link to this item:
https://doi.org/10.1017/S0963548304006352
DC Field | Value | |
---|---|---|
dc.title | Lifting Markov chains to random walks on groups | |
dc.contributor.author | Chan, O. | |
dc.contributor.author | Lam, T.K. | |
dc.date.accessioned | 2014-10-28T02:37:51Z | |
dc.date.available | 2014-10-28T02:37:51Z | |
dc.date.issued | 2005-05 | |
dc.identifier.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 | |
dc.identifier.issn | 09635483 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/103488 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1017/S0963548304006352 | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1017/S0963548304006352 | |
dc.description.sourcetitle | Combinatorics Probability and Computing | |
dc.description.volume | 14 | |
dc.description.issue | 3 | |
dc.description.page | 269-273 | |
dc.identifier.isiut | 000229283400002 | |
Appears in Collections: | Staff Publications |
Show simple 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.