-
Notifications
You must be signed in to change notification settings - Fork 913
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
Confusion with BFS and DFS #117
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi there,
I have a little confusion about your paper. In section 4.1,
Case Study: Les Misérables network
, you show us a homophily result with q<1 and a structural equivalence result with q>1. But in previous section, you said q<1 can achieve DFS while q>1 achieve BFS. I wonder why DFS random walks result in homophily result and BFS random walks result in structural equivalence result. Intuitively, I think BFS can make homophily.The text was updated successfully, but these errors were encountered: