A model for random braiding in graph configuration spaces

DOI10.1093/IMRN/RNAB008MaRDI QIDQ5068155zbMATH OpenOpenAlexFDO

Authors David A. Levin, Eric Ramos, Benjamin Young

Publication date 5 April 2022

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.00674

zbMATH Keywords

graph configuration spacesMarkov chainsrandom braiding

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

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.

Recommendations

• Configuration spaces of graphs with certain permitted collisions
• Farley-Sabalka's Morse-theory model and the higher topological complexity of ordered configuration spaces on trees
• scientific article; zbMATH DE number 7203426
• Topology of configuration space of two particles on a graph. I.
• Discrete Morse theory and graph braid groups.

Cited in

(2)

• A model for random chain complexes
• Families of Markov chains with compatible symmetric-group actions

This page was built for publication: A model for random braiding in graph configuration spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5068155)