Estimating noncommutative distances on graphs
Abstract
We report on some findings concerning Connes' noncommutative distance d on a weighted undirected graph G. Our main result is the lower bound /(G) d where is the geodesic distance and (G) the degree of G. It is obtained thanks to an auxiliary spectral triple on the collection of the edges of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.