Haochen Chen

Thanks for working on this! It would be really helpful if you can add the usage of the new argument in README. Also, can we also test it by: 1)...

For dimension match: yeah, I think we should assert that the loaded vectors have the same dimension as `--representation_size`, otherwise just abort the program.

> > For dimension match: yeah, I think we should assert that the loaded vectors have the same dimension as `--representation_size`, otherwise just abort the program. > > I was...

> > Also, how do we handle the case when vocabulary in the pre-trained embedding does not match the list of graph nodes? > > I'm not sure. I thought...

> Thanks for taking the time to help me out! I am kind of taking some time to study for my finals right now, but I will be back soon...

Could it be some nodes without any edges? No random walks can be generated thus no node embeddings either

What OS are you using? What is the exact command you ran? This question seems to be related: https://stackoverflow.com/questions/15900366/all-example-concurrent-futures-code-is-failing-with-brokenprocesspool

@phanein do we still need that link? I think it's the same content as the current README but not entirely sure

Answering this for posterity. Yes multi-thread works; since HARP is a meta-algorithm built upon other graph embedding methods, multi-threading works for HARP as long as the underlying method supports multi-threading.

Great question. I would say that the idea of using graph coarsening is important; the exact graph coarsening method being used is not that important. That said, I use the...