2000 character limit reached
On the length of chains in a metric space
Published 22 Sep 2019 in math.PR, math.FA, and math.MG | (1909.09988v2)
Abstract: We obtain an upper bound on the minimal number of points in an $\epsilon$-chain joining two points in a metric space. This generalizes a bound due to Hambly and Kumagai (1999) for the case of resistance metric on certain self-similar fractals. As an application, we deduce a condition on $\epsilon$-chains introduced by Grigor'yan and Telcs (2012). This allows us to obtain sharp bounds on the heat kernel for spaces satisfying the parabolic Harnack inequality without assuming further conditions on the metric. A snowflake transform on the Euclidean space shows that our bound is sharp.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.