2000 character limit reached
Curvature dimension inequalities on directed graphs (1701.01510v1)
Published 6 Jan 2017 in math.DG
Abstract: In this paper, we define the curvature dimension inequalities CD(m, K) on finite directed graphs modifying the case of undirected graphs. As a main result, we evaluate m and K on finite directed graphs.
Sponsor
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.