Convergence of random graph Laplacian eigenmaps on an interval
Convergence of random graph Laplacian eigenmaps on an interval
Let denote the eigenfunction of the Laplacian on , and let denote the eigenfunction of a graph Laplacian . Convergence conjecture. If and , then
as . For , the convergence is improved to convergence in energy, and for , it is further improved to convergence of the Laplacians. These conjectured convergence rates would substantially improve the bounds supplied by the preceding theorems for low-frequency eigenfunctions.
Sources & referencesView supporting material
Primary source
Bernard Akwei, Bobita Atkins, Rachel Bailey, Ashka Dalal, Natalie Dinin, Jonathan Kerby-White, Tess McGuinness, Tonya Patricks, Luke Rogers, Genevieve Romanelli, Yiheng Su and Alexander Teplyaev, “Convergence, optimization and stability of singular eigenmaps”, arXiv:2406.19510 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.