Estimating noncommutative distances on graphs

We report on some findings concerning Connes’ noncommutative distance $d$ on a weighted undirected graph $G$. Our main result is the lower bound $\mathrm{\ell }\mathrm{/}\mathrm{\Delta }(G)\le d$ where $\mathrm{\ell }$ is the geodesic distance and $\mathrm{\Delta }(G)$ the degree of $G$. It is obtained thanks to an auxiliary spectral triple on the collection of the edges of $G$.