Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Extrapolation methods for accelerating PageRank computations
WWW '03 Proceedings of the 12th international conference on World Wide Web
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A uniform approach to accelerated PageRank computation
WWW '05 Proceedings of the 14th international conference on World Wide Web
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
SIAM Journal on Scientific Computing
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Local Graph Partitioning using PageRank Vectors
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Shape Representation and Classification Using the Poisson Equation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
The dynamics of viral marketing
ACM Transactions on the Web (TWEB)
Dynamic personalized pagerank in entity-relation graphs
Proceedings of the 16th international conference on World Wide Web
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
SIAM Journal on Numerical Analysis
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Measurement Manipulation and Space Selection in Network Coordinates
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Local approximation of pagerank and reverse pagerank
Proceedings of the 17th ACM conference on Information and knowledge management
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Orion: shortest path estimation for large social graphs
WOSN'10 Proceedings of the 3rd conference on Online social networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Fast personalized PageRank on MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Robust multi-body motion tracking using commute time clustering
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Robust outlier detection using commute time and eigenspace embedding
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
On the bursty evolution of online social networks
Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research
Multi-scale dynamics in a massive online social network
Proceedings of the 2012 ACM conference on Internet measurement conference
Hi-index | 0.00 |
Analysis of large graphs is critical to the ongoing growth of search engines and social networks. One class of queries centers around node affinity, often quantified by random-walk distances between node pairs, including hitting time, commute time, and personalized PageRank (PPR). Despite the potential of these "metrics," they are rarely, if ever, used in practice, largely due to extremely high computational costs. In this paper, we investigate methods to scalably and efficiently compute random-walk distances, by "embedding" graphs and distances into points and distances in geometric coordinate spaces. We show that while existing graph coordinate systems (GCS) can accurately estimate shortest path distances, they produce significant errors when embedding random-walk distances. Based on our observations, we propose a new graph embedding system that explicitly accounts for per-node graph properties that affect random walk. Extensive experiments on a range of graphs show that our new approach can accurately estimate both symmetric and asymmetric random-walk distances. Once a graph is embedded, our system can answer queries between any two nodes in 8 microseconds, orders of magnitude faster than existing methods. Finally, we show that our system produces estimates that can replace ground truth in applications with minimal impact on application output.