On the Embeddability of Random Walk Distances

By Xiaohan Zhao, Adelbert Chang, Atish Das Sarma, Haitao Zheng, Ben Y. Zhao. 2013

36 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Kevin Chen-Chuan Chang
2. Haibo Chen
3. Vincent Wenchen Zheng
4. Binyu Zang
5. Sergey Ivanov
6. Evgeny Burnaev
7. Ihab F. Ilyas

In Statistical and Nonlinear Physics

1. Kevin Chen-Chuan Chang
2. Vincent Wenchen Zheng
3. Hongyun Cai
4. Sergey Ivanov
5. Evgeny Burnaev

In Signal Processing

1. Kevin Chen-Chuan Chang
2. Haibo Chen
3. Vincent Wenchen Zheng
4. Binyu Zang
5. Yu Zheng
6. Ihab F. Ilyas

Citations in the corpus

• A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications (2017, methodology): “nodes of interest to a given node based on certain criteria such as similarity [3], [16], [43], [45], [47], [106].”
• PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs (2019, background): “Graph-structured computation has be come increasingly popular, which is evidenced by its adoption in a wide range of areas including social computation, web search, natural language processing, and recommendation systems [5, 25, 54, 67, 88, 98].”