{"title":"循环随机漫步上的函数","authors":"V.R. Manivannan, M. Venkataraman","doi":"10.35634/vm230108","DOIUrl":null,"url":null,"abstract":"If a random walk on a countable infinite state space is reversible, there are known necessary and sufficient conditions for the walk to be recurrent. When the condition of reversibility is dropped, by using discrete Dirichlet solutions and balayage (concepts familiar in potential theory) one could partially retrieve some of the above results concerning the recurrence and the transience of the random walk.","PeriodicalId":43239,"journal":{"name":"Vestnik Udmurtskogo Universiteta-Matematika Mekhanika Kompyuternye Nauki","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Delta-functions on recurrent random walks\",\"authors\":\"V.R. Manivannan, M. Venkataraman\",\"doi\":\"10.35634/vm230108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"If a random walk on a countable infinite state space is reversible, there are known necessary and sufficient conditions for the walk to be recurrent. When the condition of reversibility is dropped, by using discrete Dirichlet solutions and balayage (concepts familiar in potential theory) one could partially retrieve some of the above results concerning the recurrence and the transience of the random walk.\",\"PeriodicalId\":43239,\"journal\":{\"name\":\"Vestnik Udmurtskogo Universiteta-Matematika Mekhanika Kompyuternye Nauki\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vestnik Udmurtskogo Universiteta-Matematika Mekhanika Kompyuternye Nauki\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.35634/vm230108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vestnik Udmurtskogo Universiteta-Matematika Mekhanika Kompyuternye Nauki","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35634/vm230108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
If a random walk on a countable infinite state space is reversible, there are known necessary and sufficient conditions for the walk to be recurrent. When the condition of reversibility is dropped, by using discrete Dirichlet solutions and balayage (concepts familiar in potential theory) one could partially retrieve some of the above results concerning the recurrence and the transience of the random walk.