A model for random braiding in graph configuration spaces
Combinatorics
2020-04-03 v1 Algebraic Topology
Probability
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.
Keywords
Cite
@article{arxiv.2004.00674,
title = {A model for random braiding in graph configuration spaces},
author = {David A. Levin and Eric Ramos and Benjamin Young},
journal= {arXiv preprint arXiv:2004.00674},
year = {2020}
}