Graph Laplacians and their convergence on random neighborhood graphs
Matthias Hein, Jean-Yves Audibert, Ulrike Luxburg
Paper
From BibTeX import
Journal of Machine Learning Research 8, pp. 1325–1368, 2007
Notes
Cited in riva2026intensity as prior work on convergence of discrete graph Laplacians to continuous operators on random neighborhood graphs, flagged as the closest analogue for a future IDPG Laplacian limit theorem.
References
No references yet.