Closed gaborcsardi closed 10 years ago
Maybe this should be called laplacian.spectral.embedding
or lse
then?
Yes, lse
is fine, with options to indicate which of the various versions we want.
What is the definition you want for the Laplacian of a directed graph? Most definitions do not make much sense, maybe this is the best: F. Chung, Laplacians and the Cheeger inequality for directed graphs, Annals of Combinatorics 9 (2005), pp. 1-19
Actually docs are missing.... and the directed case, too.
Sorry for ignoring this earlier. Again it might be good to have a couple options. The version in Chung is symmetric which seems strange for a directed graph.
I think http://arxiv.org/pdf/1204.2296v1.pdf Eq (2.3) would be my preference for the default.
Daniel:
From #38.