On a variant of the product replacement algorithm
We discuss a variant, named ‘Rattle’, of the product replacement algorithm. Rattle is a Markov chain, that returns a random element of a black box group. The limiting distribution of the element returned is the uniform distribution. We prove that, if the generating sequence is long enough, the proba...
Gespeichert in:
| Veröffentlicht in: | Glasgow mathematical journal 2024-01, Vol.66 (1), p.221-228 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 228 |
|---|---|
| container_issue | 1 |
| container_start_page | 221 |
| container_title | Glasgow mathematical journal |
| container_volume | 66 |
| creator | Leedham-Green, C.R. |
| description | We discuss a variant, named ‘Rattle’, of the product replacement algorithm. Rattle is a Markov chain, that returns a random element of a black box group. The limiting distribution of the element returned is the uniform distribution. We prove that, if the generating sequence is long enough, the probability distribution of the element returned converges unexpectedly quickly to the uniform distribution. |
| doi_str_mv | 10.1017/S0017089523000435 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2931522162</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0017089523000435</cupid><sourcerecordid>2931522162</sourcerecordid><originalsourceid>FETCH-LOGICAL-c269t-3dbc55fe7b570483c290dfa025420723f9b6d30988704cced8db0e934ba320833</originalsourceid><addsrcrecordid>eNp1UEtLxDAQDqJgXf0B3gKeq5NM0yZHWXzBwh5U8FbSJN3t0pdpKvjvzbILHsTLDB_fY4aPkGsGtwxYcfcKcYJUgiMAZChOSMKyXKUC1McpSfZ0uufPycU07SLEiBLC1j3V9Ev7RveBDjUNW0dHP9jZBOrd2GrjOhcp3W4G34Rtd0nOat1O7uq4F-T98eFt-Zyu1k8vy_tVaniuQoq2MkLUrqhEAZlEwxXYWgMXGYeCY62q3CIoKSNtjLPSVuAUZpVGDhJxQW4OufGbz9lNodwNs-_jyZIrZIJzlvOoYgeV8cM0eVeXo2867b9LBuW-mfJPM9GDR4_uKt_YjfuN_t_1AyFZYyo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2931522162</pqid></control><display><type>article</type><title>On a variant of the product replacement algorithm</title><source>Cambridge University Press Journals Complete</source><creator>Leedham-Green, C.R.</creator><creatorcontrib>Leedham-Green, C.R.</creatorcontrib><description>We discuss a variant, named ‘Rattle’, of the product replacement algorithm. Rattle is a Markov chain, that returns a random element of a black box group. The limiting distribution of the element returned is the uniform distribution. We prove that, if the generating sequence is long enough, the probability distribution of the element returned converges unexpectedly quickly to the uniform distribution.</description><identifier>ISSN: 0017-0895</identifier><identifier>EISSN: 1469-509X</identifier><identifier>DOI: 10.1017/S0017089523000435</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Algorithms ; Eigenvalues ; Markov analysis ; Markov chains ; Probability distribution</subject><ispartof>Glasgow mathematical journal, 2024-01, Vol.66 (1), p.221-228</ispartof><rights>The Author(s), 2024. Published by Cambridge University Press on behalf of Glasgow Mathematical Journal Trust</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c269t-3dbc55fe7b570483c290dfa025420723f9b6d30988704cced8db0e934ba320833</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0017089523000435/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,314,780,784,27924,27925,55628</link.rule.ids></links><search><creatorcontrib>Leedham-Green, C.R.</creatorcontrib><title>On a variant of the product replacement algorithm</title><title>Glasgow mathematical journal</title><addtitle>Glasgow Math. J</addtitle><description>We discuss a variant, named ‘Rattle’, of the product replacement algorithm. Rattle is a Markov chain, that returns a random element of a black box group. The limiting distribution of the element returned is the uniform distribution. We prove that, if the generating sequence is long enough, the probability distribution of the element returned converges unexpectedly quickly to the uniform distribution.</description><subject>Algorithms</subject><subject>Eigenvalues</subject><subject>Markov analysis</subject><subject>Markov chains</subject><subject>Probability distribution</subject><issn>0017-0895</issn><issn>1469-509X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp1UEtLxDAQDqJgXf0B3gKeq5NM0yZHWXzBwh5U8FbSJN3t0pdpKvjvzbILHsTLDB_fY4aPkGsGtwxYcfcKcYJUgiMAZChOSMKyXKUC1McpSfZ0uufPycU07SLEiBLC1j3V9Ev7RveBDjUNW0dHP9jZBOrd2GrjOhcp3W4G34Rtd0nOat1O7uq4F-T98eFt-Zyu1k8vy_tVaniuQoq2MkLUrqhEAZlEwxXYWgMXGYeCY62q3CIoKSNtjLPSVuAUZpVGDhJxQW4OufGbz9lNodwNs-_jyZIrZIJzlvOoYgeV8cM0eVeXo2867b9LBuW-mfJPM9GDR4_uKt_YjfuN_t_1AyFZYyo</recordid><startdate>20240101</startdate><enddate>20240101</enddate><creator>Leedham-Green, C.R.</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20240101</creationdate><title>On a variant of the product replacement algorithm</title><author>Leedham-Green, C.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c269t-3dbc55fe7b570483c290dfa025420723f9b6d30988704cced8db0e934ba320833</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Eigenvalues</topic><topic>Markov analysis</topic><topic>Markov chains</topic><topic>Probability distribution</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Leedham-Green, C.R.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Glasgow mathematical journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Leedham-Green, C.R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On a variant of the product replacement algorithm</atitle><jtitle>Glasgow mathematical journal</jtitle><addtitle>Glasgow Math. J</addtitle><date>2024-01-01</date><risdate>2024</risdate><volume>66</volume><issue>1</issue><spage>221</spage><epage>228</epage><pages>221-228</pages><issn>0017-0895</issn><eissn>1469-509X</eissn><abstract>We discuss a variant, named ‘Rattle’, of the product replacement algorithm. Rattle is a Markov chain, that returns a random element of a black box group. The limiting distribution of the element returned is the uniform distribution. We prove that, if the generating sequence is long enough, the probability distribution of the element returned converges unexpectedly quickly to the uniform distribution.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S0017089523000435</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0017-0895 |
| ispartof | Glasgow mathematical journal, 2024-01, Vol.66 (1), p.221-228 |
| issn | 0017-0895 1469-509X |
| language | eng |
| recordid | cdi_proquest_journals_2931522162 |
| source | Cambridge University Press Journals Complete |
| subjects | Algorithms Eigenvalues Markov analysis Markov chains Probability distribution |
| title | On a variant of the product replacement algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T10%3A21%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20a%20variant%20of%20the%20product%20replacement%20algorithm&rft.jtitle=Glasgow%20mathematical%20journal&rft.au=Leedham-Green,%20C.R.&rft.date=2024-01-01&rft.volume=66&rft.issue=1&rft.spage=221&rft.epage=228&rft.pages=221-228&rft.issn=0017-0895&rft.eissn=1469-509X&rft_id=info:doi/10.1017/S0017089523000435&rft_dat=%3Cproquest_cross%3E2931522162%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2931522162&rft_id=info:pmid/&rft_cupid=10_1017_S0017089523000435&rfr_iscdi=true |