1. S. Amghibech. 2003. Eigenvalues of the Discrete p-Laplacian for Graphs. Ars Comb. 67(2003).
2. Reid Andersen, Fan Chung, and Kevin Lang. 2006. Local Graph Partitioning using PageRank Vectors. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. IEEE, IEEE, Washington, D.C., USA, 475-486. http://www.math.ucsd.edu/~fan/wp/localpartition.pdf
3. Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. 2006. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of machine learning research 7, Nov (2006), 2399-2434.
4. Philippe Be´nilan and Michael G Crandall. 1981. The continuous dependence on f of solutions of u t- ?f (u)= 0. Indiana University Mathematics Journal 30, 2 (1981), 161-177.
5. Austin Benson, David F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Submitted. Science 353, 6295 (2016), 163-166. https://doi.org/10.1126/science.aad9029