Abstract
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the average distance between points on a given sphere. Averaging is not technically possible because metric spheres in the curve complex are countably infinite and do not support any invariant probability measures. To make sense of the idea of averaging, we instead develop definitions of null and generic subsets in a way that is compatible with the topological structure of the curve complex. With respect to this notion of genericity, we show that pairs of points on a sphere of radius R almost always have distance exactly 2R apart, which is as large as possible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
