{"title":"随机有界一维网络的连接概率","authors":"Lorenzo Federico","doi":"10.1007/s11565-024-00508-6","DOIUrl":null,"url":null,"abstract":"<div><p>We consider a class of bounded-range 1<i>D</i> network models on a cycle and prove that, unlike the corresponding infinite-volume models, which never contain infinite components, they actually exhibit a phase transition for connectivity. We further show that depending on the specific choice of the edge probabilities, the last obstruction to connectivity can either be the existence of isolated vertices or the split of the cycle into two spatially separated components.</p></div>","PeriodicalId":35009,"journal":{"name":"Annali dell''Universita di Ferrara","volume":"70 4","pages":"1389 - 1403"},"PeriodicalIF":0.0000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11565-024-00508-6.pdf","citationCount":"0","resultStr":"{\"title\":\"Connecting probability for random bounded-range one-dimensional network\",\"authors\":\"Lorenzo Federico\",\"doi\":\"10.1007/s11565-024-00508-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We consider a class of bounded-range 1<i>D</i> network models on a cycle and prove that, unlike the corresponding infinite-volume models, which never contain infinite components, they actually exhibit a phase transition for connectivity. We further show that depending on the specific choice of the edge probabilities, the last obstruction to connectivity can either be the existence of isolated vertices or the split of the cycle into two spatially separated components.</p></div>\",\"PeriodicalId\":35009,\"journal\":{\"name\":\"Annali dell''Universita di Ferrara\",\"volume\":\"70 4\",\"pages\":\"1389 - 1403\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s11565-024-00508-6.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annali dell''Universita di Ferrara\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11565-024-00508-6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annali dell''Universita di Ferrara","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s11565-024-00508-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
Connecting probability for random bounded-range one-dimensional network
We consider a class of bounded-range 1D network models on a cycle and prove that, unlike the corresponding infinite-volume models, which never contain infinite components, they actually exhibit a phase transition for connectivity. We further show that depending on the specific choice of the edge probabilities, the last obstruction to connectivity can either be the existence of isolated vertices or the split of the cycle into two spatially separated components.
期刊介绍：
Annali dell''Università di Ferrara is a general mathematical journal publishing high quality papers in all aspects of pure and applied mathematics. After a quick preliminary examination, potentially acceptable contributions will be judged by appropriate international referees. Original research papers are preferred, but well-written surveys on important subjects are also welcome.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
