{"title":"图组态空间中的随机编织模型","authors":"D. A. Levin, Eric Ramos, Benjamin Young","doi":"10.1093/IMRN/RNAB008","DOIUrl":null,"url":null,"abstract":"We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles in the plane. We also propose certain natural open questions and conjectures, whose confirmation would provide new insights on configuration spaces of trees.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"87 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Model for Random Braiding in Graph Configuration Spaces\",\"authors\":\"D. A. Levin, Eric Ramos, Benjamin Young\",\"doi\":\"10.1093/IMRN/RNAB008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles in the plane. We also propose certain natural open questions and conjectures, whose confirmation would provide new insights on configuration spaces of trees.\",\"PeriodicalId\":8442,\"journal\":{\"name\":\"arXiv: Combinatorics\",\"volume\":\"87 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/IMRN/RNAB008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/IMRN/RNAB008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Model for Random Braiding in Graph Configuration Spaces
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles in the plane. We also propose certain natural open questions and conjectures, whose confirmation would provide new insights on configuration spaces of trees.