2000 character limit reached
Distance bounds for graphs with some negative Bakry-Émery curvature
Published 23 May 2017 in math.DG | (1705.08119v2)
Abstract: We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits an explicit upper bound for the diameter. Otherwise, the graph is a subset of the tubular neighborhood with an explicit radius around the non-positively curved vertices. Those results seem to be the first assuming non-constant Bakry-\'Emery curvature assumptions on graphs.
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.