arXiv · 2412.20591
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Patrick Erik Bradley. 2024-12-29. Local ultrametric approximation of graph distance based Laplacian diffusion. https://arxiv.org/abs/2412.20591
Cite the original work for its findings. Save a collection to share your selection of sources.