Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Graph multiresolution: largest_eigenvector #3

Open
mys007 opened this issue Nov 1, 2016 · 3 comments
Open

Graph multiresolution: largest_eigenvector #3

mys007 opened this issue Nov 1, 2016 · 3 comments

Comments

@mys007
Copy link

mys007 commented Nov 1, 2016

I think the behavior on L141 in gsp_graph_multiresolution.m is wrong in the case when largest_eigenvector(1)==0, which now leads to filling largest_eigenvector with 0s as sign(0)=0. I suggest L141 being executed only if largest_eigenvector(1)~=0.
Also, as eig works up to eps precision, one should IMHO have nonnegative_logicals=(largest_eigenvector >= -eps); instead of nonnegative_logicals=(largest_eigenvector >= 0);, as the current may lead to problems with graphs with multiple connected components, which are then numerically not properly identified to be kept, which may lead to NaNs in Kron reduction.

@mdeff
Copy link
Contributor

mdeff commented Sep 21, 2017

Thanks for reporting the issue. Note however that this toolbox is not developed nor maintained anymore. Please consider using the pygsp instead.

@mys007
Copy link
Author

mys007 commented Sep 21, 2017

Thanks for your reply! When/if I come back to Kron reduction again, I will definitely use the new Python toolbox (looks very nice, great work) and I will check if my two issues are still relevant there.

@mdeff
Copy link
Contributor

mdeff commented Sep 21, 2017

Thanks :) I think they'll be relevant, though I did not touch the graph multiresolution code (it was initially translated from matlab by interns). Please submit a PR if you come across them again.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Development

No branches or pull requests

2 participants