Показати простий запис статті
dc.contributor.author |
Vyshnevetskiy, A.L. |
|
dc.contributor.author |
Zhmud, E.M. |
|
dc.date.accessioned |
2019-06-14T03:38:17Z |
|
dc.date.available |
2019-06-14T03:38:17Z |
|
dc.date.issued |
2008 |
|
dc.identifier.citation |
Random walks on finite groups converging after finite number of steps / A.L. Vyshnevetskiy, E.M. Zhmud // Algebra and Discrete Mathematics. — 2008. — Vol. 7, № 2. — С. 123–129. — Бібліогр.: 3 назв. — англ. |
uk_UA |
dc.identifier.issn |
1726-3255 |
|
dc.identifier.other |
2000 Mathematics Subject Classification: 20P05, 60B15. |
|
dc.identifier.uri |
http://dspace.nbuv.gov.ua/handle/123456789/153370 |
|
dc.description.abstract |
Let P be a probability on a finite group G, P(n)=P∗…∗P (n times) be an n-fold convolution of P. If n→∞, then under mild conditions P(n) converges to the uniform probability U(g)=1|G| (g∈G). We study the case when the sequence P(n) reaches its limit U after finite number of steps: P(k)=P(k+1)=⋯=U for some k. Let Ω(G) be a set of the probabilities satisfying to that condition. Obviously, U∈Ω(G). We prove that Ω(G)≠U for ``almost all'' non-Abelian groups and describe the groups for which Ω(G)=U. If P∈Ω(G), then P(b)=U, where b is the maximal degree of irreducible complex representations of the group G. |
uk_UA |
dc.language.iso |
en |
uk_UA |
dc.publisher |
Інститут прикладної математики і механіки НАН України |
uk_UA |
dc.relation.ispartof |
Algebra and Discrete Mathematics |
|
dc.title |
Random walks on finite groups converging after finite number of steps |
uk_UA |
dc.type |
Article |
uk_UA |
dc.status |
published earlier |
uk_UA |
Файли у цій статті
Ця стаття з'являється у наступних колекціях
Показати простий запис статті