{"title":"随机游走的可能结束位置数量增长最小的度量图","authors":"V. L. Chernyshev, A. A. Tolchennikov","doi":"10.1134/S1061920822040033","DOIUrl":null,"url":null,"abstract":"<p> It is proved that a metric graph with the minimal growth of the number of possible end positions of a random walk is the union of several paths outgoing from one vertex. </p>","PeriodicalId":763,"journal":{"name":"Russian Journal of Mathematical Physics","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2023-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Metric Graph for Which the Number of Possible End Positions of a Random Walk Grows Minimally\",\"authors\":\"V. L. Chernyshev, A. A. Tolchennikov\",\"doi\":\"10.1134/S1061920822040033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p> It is proved that a metric graph with the minimal growth of the number of possible end positions of a random walk is the union of several paths outgoing from one vertex. </p>\",\"PeriodicalId\":763,\"journal\":{\"name\":\"Russian Journal of Mathematical Physics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2023-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Russian Journal of Mathematical Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1061920822040033\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Russian Journal of Mathematical Physics","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1134/S1061920822040033","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
A Metric Graph for Which the Number of Possible End Positions of a Random Walk Grows Minimally
It is proved that a metric graph with the minimal growth of the number of possible end positions of a random walk is the union of several paths outgoing from one vertex.
期刊介绍：
Russian Journal of Mathematical Physics is a peer-reviewed periodical that deals with the full range of topics subsumed by that discipline, which lies at the foundation of much of contemporary science. Thus, in addition to mathematical physics per se, the journal coverage includes, but is not limited to, functional analysis, linear and nonlinear partial differential equations, algebras, quantization, quantum field theory, modern differential and algebraic geometry and topology, representations of Lie groups, calculus of variations, asymptotic methods, random process theory, dynamical systems, and control theory.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
