The non-peripheral curve graph and divergence in big mapping class groups
arXiv:2603.21560
Abstract
We introduce a numerical invariant measuring the end-complexity of and use it to organize coarse-geometric features of Map(). Our main tool is the \emph{non-peripheral curve graph} , whose vertices are those essential simple closed curves that cannot be pushed out of every compact subsurface, with edges given by disjointness. Assuming Map() is CB-generated and , we prove that is connected, has infinite diameter, is Gromov hyperbolic, and that the Map()-action has unbounded orbits. As applications, we show that if then Map() has infinite coarse rank, and if then Map() has at most quadratic divergence, hence is one-ended.
37 pages, 3 figures