{"title":"压缩斐波那契树的极限概率转移矩阵","authors":"K. A. Germina","doi":"10.12732/IJAM.V31I2.6","DOIUrl":null,"url":null,"abstract":"This paper discusses on the construction of condensed Fibonacci trees and present the Markov chain corresponding to the condensed Fibonacci trees. An n × n finite Markov probability transition matrix for this Markov chain is presented and it is proved that the limiting steady state probabilities are proportional to the first n Fibonacci numbers. AMS Subject Classification: 05C07, 05C38, 05C75, 05C85","PeriodicalId":14365,"journal":{"name":"International journal of pure and applied mathematics","volume":"171 1","pages":"241-249"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE\",\"authors\":\"K. A. Germina\",\"doi\":\"10.12732/IJAM.V31I2.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses on the construction of condensed Fibonacci trees and present the Markov chain corresponding to the condensed Fibonacci trees. An n × n finite Markov probability transition matrix for this Markov chain is presented and it is proved that the limiting steady state probabilities are proportional to the first n Fibonacci numbers. AMS Subject Classification: 05C07, 05C38, 05C75, 05C85\",\"PeriodicalId\":14365,\"journal\":{\"name\":\"International journal of pure and applied mathematics\",\"volume\":\"171 1\",\"pages\":\"241-249\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of pure and applied mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12732/IJAM.V31I2.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of pure and applied mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12732/IJAM.V31I2.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE
This paper discusses on the construction of condensed Fibonacci trees and present the Markov chain corresponding to the condensed Fibonacci trees. An n × n finite Markov probability transition matrix for this Markov chain is presented and it is proved that the limiting steady state probabilities are proportional to the first n Fibonacci numbers. AMS Subject Classification: 05C07, 05C38, 05C75, 05C85