A Model for Random Braiding in Graph Configuration Spaces

INTERNATIONAL MATHEMATICS RESEARCH NOTICES(2022)

引用 1|浏览3
暂无评分
摘要
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.
更多
查看译文
关键词
graph configuration spaces, Markov chains, random braiding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要