Local ultrametric approximation of graph distance based Laplacian diffusion

Abstract

The error estimation for eigenvalues and eigenvectors of a small positive symmetric perturbation on the spectrum of a graph Laplacian is related to Gau{\ss} hypergeometric functions. Based on this, a heuristic polynomial-time algorithm for finding an optimal locally ultrametric approximation of a graph-distance power Laplacian matrix via the Vietoris-Rips graph based on the graph distance function is proposed. In the end, the error in the solution to the graph Laplacian heat equation given by extension to a locally p-adic equation is estimated.