Is there an easy way to compute the second smallest eigenvalue in question if the graph is large?
There is a well-known theorem that quickly computes the smallest eigenvalue if the graph is bipartite, but I'm not aware of any generalization (which may be quite useful for some results in econometrics).
4 comments
[ 0.21 ms ] story [ 20.7 ms ] threadThere is a well-known theorem that quickly computes the smallest eigenvalue if the graph is bipartite, but I'm not aware of any generalization (which may be quite useful for some results in econometrics).
[1]:http://en.m.wikipedia.org/wiki/Lanczos_algorithm
Wish I had some data to apply it too :-)