{"title":"转子-路由器模型的晶格结构","authors":"Le Manh Ha","doi":"10.1109/RIVF.2010.5633377","DOIUrl":null,"url":null,"abstract":"In this paper, we study the rotor router model in the relation with the famous discrete dynamical system - Chip Firing Game. We consider the rotor router model as a discrete dynamical system defined on digraph and we use order theory to show that its state space started from any state is a lattice, which implies strong structural properties. The lattice structure of the state space of a dynamical system is of great interest since it implies convergence (and more) if the state space is finite. Moreover, we also attempt to define the class $L(\\mathcal R)$ of lattices that are state space of a rotor router model, and compare it with the class of distributive lattices and the class of ULD lattices.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Lattice Structure of Rotor-Router Model\",\"authors\":\"Le Manh Ha\",\"doi\":\"10.1109/RIVF.2010.5633377\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the rotor router model in the relation with the famous discrete dynamical system - Chip Firing Game. We consider the rotor router model as a discrete dynamical system defined on digraph and we use order theory to show that its state space started from any state is a lattice, which implies strong structural properties. The lattice structure of the state space of a dynamical system is of great interest since it implies convergence (and more) if the state space is finite. Moreover, we also attempt to define the class $L(\\\\mathcal R)$ of lattices that are state space of a rotor router model, and compare it with the class of distributive lattices and the class of ULD lattices.\",\"PeriodicalId\":171525,\"journal\":{\"name\":\"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies\",\"volume\":\"126 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2010.5633377\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2010.5633377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we study the rotor router model in the relation with the famous discrete dynamical system - Chip Firing Game. We consider the rotor router model as a discrete dynamical system defined on digraph and we use order theory to show that its state space started from any state is a lattice, which implies strong structural properties. The lattice structure of the state space of a dynamical system is of great interest since it implies convergence (and more) if the state space is finite. Moreover, we also attempt to define the class $L(\mathcal R)$ of lattices that are state space of a rotor router model, and compare it with the class of distributive lattices and the class of ULD lattices.