Uniform spectral convergence of Euclidean graph approximations on the Sierpiński gasket
Uniform spectral convergence of Euclidean graph approximations on the Sierpiński gasket
Let be the Sierpiński gasket with Laplacian . Consider the rescaled averaging Laplacian and the rescaled graph Laplacian at random sample points, both defined using the Euclidean metric on . Euclidean spectral convergence conjecture. With a proper choice of normalization and alignment, their eigenvalues and eigenfunctions converge uniformly to those of as and . The conjecture leaves the optimal behavior of for the most accurate convergence unknown and is motivated by numerical investigations and comparison with the cellular semimetric.
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.