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.
Citation
Kazuhiro Ichihara. Ken-ichi Yoshida. "On the most expected number of components for random links." Tohoku Math. J. (2) 69 (4) 637 - 641, 2017. https://doi.org/10.2748/tmj/1512183634
