arXiv · 1507.03110
On the most expected number of components for random links
Abstract
We consider a random link, which is defined as the closure of a braid obtained from a random walk on the braid group. For such a random link, the expected value for the number of components was calculated by Jiming Ma. In this paper, we determine the most expected number of components for a random link, and further, consider the most expected partition of the number of strings for a random braid.
Explore related subjects
Keep this discovery
Kazuhiro Ichihara, Ken-ichi Yoshida. 2015-07-11. On the most expected number of components for random links. https://arxiv.org/abs/1507.03110
Cite the original work for its findings. Save a collection to share your selection of sources.