Spiral Structures in the Rotor-Router Walk

We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2016-06
Hauptverfasser: Papoyan, Vl V, Poghosyan, V S, Priezzhev, V B
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Papoyan, Vl V
Poghosyan, V S
Priezzhev, V B
description We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence of labels in the rotor-router walk was conjectured to form a spiral structure obeying asymptotically an Archimedean property. In the present paper, we select a subset of labels called "nodes" and consider spirals formed by nodes. The new spirals are directly related to tree-like structures which represent the evolution of the cluster of vertices visited by the walk. We show that the average number of visits to the origin \(\left\) by the moment \(t\gg 1\) is \(\left = 4 \left + O(1)\) where \(\left\) is the average number of rotations of the spiral.
doi_str_mv 10.48550/arxiv.1512.00280
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1512_00280</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2080144275</sourcerecordid><originalsourceid>FETCH-LOGICAL-a525-c15d2f9206ffd69625860ec424a3e3e23ac20a277f25dc557ab3ae1243046bd83</originalsourceid><addsrcrecordid>eNotj1FLwzAUhYMgOOZ-gE8WfBNab25y0-xRhjphIGwDH8tdm2JnXWuSiv576-bTgcPH4XxCXEnItCWCO_bfzVcmSWIGgBbOxASVkqnViBdiFsIext7kSKQm4nbTN57bZBP9UMbBu5A0hyS-uWTdxc6n626Iziev3L5fivOa2-Bm_zkV28eH7WKZrl6enhf3q5QJKS0lVVjPEUxdV2ZukKwBV2rUrJxyqLhEYMzzGqkqiXLeKXYStQJtdpVVU3F9mj2KFL1vPtj_FH9CxVFoJG5ORO-7z8GFWOy7wR_GTwWCBak15qR-AU7US-g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2080144275</pqid></control><display><type>article</type><title>Spiral Structures in the Rotor-Router Walk</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Papoyan, Vl V ; Poghosyan, V S ; Priezzhev, V B</creator><creatorcontrib>Papoyan, Vl V ; Poghosyan, V S ; Priezzhev, V B</creatorcontrib><description>We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence of labels in the rotor-router walk was conjectured to form a spiral structure obeying asymptotically an Archimedean property. In the present paper, we select a subset of labels called "nodes" and consider spirals formed by nodes. The new spirals are directly related to tree-like structures which represent the evolution of the cluster of vertices visited by the walk. We show that the average number of visits to the origin \(\left&lt;n_0(t)\right&gt;\) by the moment \(t\gg 1\) is \(\left&lt;n_0(t)\right&gt; = 4 \left&lt;n(t)\right&gt; + O(1)\) where \(\left&lt;n(t)\right&gt;\) is the average number of rotations of the spiral.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1512.00280</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Apexes ; Labels ; Mathematics - Combinatorics ; Mathematics - Probability ; Nodes ; Physics - Statistical Mechanics ; Rotors ; Spirals</subject><ispartof>arXiv.org, 2016-06</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,781,882,27906</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1512.00280$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1088/1742-5468/2016/04/043207$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Papoyan, Vl V</creatorcontrib><creatorcontrib>Poghosyan, V S</creatorcontrib><creatorcontrib>Priezzhev, V B</creatorcontrib><title>Spiral Structures in the Rotor-Router Walk</title><title>arXiv.org</title><description>We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence of labels in the rotor-router walk was conjectured to form a spiral structure obeying asymptotically an Archimedean property. In the present paper, we select a subset of labels called "nodes" and consider spirals formed by nodes. The new spirals are directly related to tree-like structures which represent the evolution of the cluster of vertices visited by the walk. We show that the average number of visits to the origin \(\left&lt;n_0(t)\right&gt;\) by the moment \(t\gg 1\) is \(\left&lt;n_0(t)\right&gt; = 4 \left&lt;n(t)\right&gt; + O(1)\) where \(\left&lt;n(t)\right&gt;\) is the average number of rotations of the spiral.</description><subject>Apexes</subject><subject>Labels</subject><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Probability</subject><subject>Nodes</subject><subject>Physics - Statistical Mechanics</subject><subject>Rotors</subject><subject>Spirals</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj1FLwzAUhYMgOOZ-gE8WfBNab25y0-xRhjphIGwDH8tdm2JnXWuSiv576-bTgcPH4XxCXEnItCWCO_bfzVcmSWIGgBbOxASVkqnViBdiFsIext7kSKQm4nbTN57bZBP9UMbBu5A0hyS-uWTdxc6n626Iziev3L5fivOa2-Bm_zkV28eH7WKZrl6enhf3q5QJKS0lVVjPEUxdV2ZukKwBV2rUrJxyqLhEYMzzGqkqiXLeKXYStQJtdpVVU3F9mj2KFL1vPtj_FH9CxVFoJG5ORO-7z8GFWOy7wR_GTwWCBak15qR-AU7US-g</recordid><startdate>20160624</startdate><enddate>20160624</enddate><creator>Papoyan, Vl V</creator><creator>Poghosyan, V S</creator><creator>Priezzhev, V B</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20160624</creationdate><title>Spiral Structures in the Rotor-Router Walk</title><author>Papoyan, Vl V ; Poghosyan, V S ; Priezzhev, V B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a525-c15d2f9206ffd69625860ec424a3e3e23ac20a277f25dc557ab3ae1243046bd83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Apexes</topic><topic>Labels</topic><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Probability</topic><topic>Nodes</topic><topic>Physics - Statistical Mechanics</topic><topic>Rotors</topic><topic>Spirals</topic><toplevel>online_resources</toplevel><creatorcontrib>Papoyan, Vl V</creatorcontrib><creatorcontrib>Poghosyan, V S</creatorcontrib><creatorcontrib>Priezzhev, V B</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Papoyan, Vl V</au><au>Poghosyan, V S</au><au>Priezzhev, V B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Spiral Structures in the Rotor-Router Walk</atitle><jtitle>arXiv.org</jtitle><date>2016-06-24</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence of labels in the rotor-router walk was conjectured to form a spiral structure obeying asymptotically an Archimedean property. In the present paper, we select a subset of labels called "nodes" and consider spirals formed by nodes. The new spirals are directly related to tree-like structures which represent the evolution of the cluster of vertices visited by the walk. We show that the average number of visits to the origin \(\left&lt;n_0(t)\right&gt;\) by the moment \(t\gg 1\) is \(\left&lt;n_0(t)\right&gt; = 4 \left&lt;n(t)\right&gt; + O(1)\) where \(\left&lt;n(t)\right&gt;\) is the average number of rotations of the spiral.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1512.00280</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2016-06
issn 2331-8422
language eng
recordid cdi_arxiv_primary_1512_00280
source arXiv.org; Free E- Journals
subjects Apexes
Labels
Mathematics - Combinatorics
Mathematics - Probability
Nodes
Physics - Statistical Mechanics
Rotors
Spirals
title Spiral Structures in the Rotor-Router Walk
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T01%3A05%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Spiral%20Structures%20in%20the%20Rotor-Router%20Walk&rft.jtitle=arXiv.org&rft.au=Papoyan,%20Vl%20V&rft.date=2016-06-24&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1512.00280&rft_dat=%3Cproquest_arxiv%3E2080144275%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2080144275&rft_id=info:pmid/&rfr_iscdi=true