A Model for Random Braiding in Graph Configuration Spaces

David A. Levin, Eric Ramos, Benjamin Young

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 [42]. We also propose certain natural open questions and conjectures, whose confirmation would provide new insights on configuration spaces of trees.

Original languageEnglish
Pages (from-to)5564-5600
Number of pages37
JournalInternational Mathematics Research Notices
Volume2022
Issue number7
DOIs
StatePublished - 1 Apr 2022

Keywords

  • Graph configuration spaces
  • Markov chains
  • Random braiding

Fingerprint

Dive into the research topics of 'A Model for Random Braiding in Graph Configuration Spaces'. Together they form a unique fingerprint.

Cite this