Random meander model for links
From MaRDI portal
Abstract: We describe a new random model for links based on meanders. Random meander diagrams correspond to matching pairs of parentheses, a well-studied problem in combinatorics. Hence tools from combinatorics can be used to investigate properties of links. We prove that unlinks appear with vanishing probability, no link is obtained with probability 1, and there is a lower bound for the number of non-isotopic knots obtained on every step. Then we give expected twist number of a diagram, and bound expected hyperbolic and simplicial volume of links.
This page was built for publication: Random meander model for links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505865)
