On computer viral infection and the effect of immunization
ACSAC '00 Proceedings of the 16th Annual Computer Security Applications Conference
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
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
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
On suitability of Euclidean embedding of internet hosts
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
Do social networks improve e-commerce?: a study on social marketplaces
Proceedings of the first workshop on Online social networks
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Temporal distance metrics for social network analysis
Proceedings of the 2nd ACM workshop on Online social networks
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
What is Twitter, a social network or a news media?
Proceedings of the 19th international conference on World wide web
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
A Survey on Network Coordinates Systems, Design, and Security
IEEE Communications Surveys & Tutorials
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
IDES: An Internet Distance Estimation Service for Large Networks
IEEE Journal on Selected Areas in Communications
Pomelo: accurate and decentralized shortest-path distance estimation in social graphs
Proceedings of the ACM SIGCOMM 2011 conference
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Shortest paths in less than a millisecond
Proceedings of the 2012 ACM workshop on Workshop on online social networks
Measuring two-event structural correlations on graphs
Proceedings of the VLDB Endowment
A survey on proximity measures for social networks
Search Computing
Trinity: a distributed graph engine on a memory cloud
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
On the embeddability of random walk distances
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Through measurements, researchers continue to produce large social graphs that capture relationships, transactions, and social interactions between users. Efficient analysis of these graphs requires algorithms that scale well with graph size. We examine node distance computation, a critical primitive in graph problems such as computing node separation, centrality computation, mutual friend detection, and community detection. For large million-node social graphs, computing even a single shortest path using traditional breadth-first-search can take several seconds. In this paper, we propose a novel node distance estimation mechanism that effectively maps nodes in high dimensional graphs to positions in low-dimension Euclidean coordinate spaces, thus allowing constant time node distance computation. We describe Orion, a pro totype graph coordinate system, and explore critical decisions in its design. Finally, we evaluate the accuracy of Orion's node distance estimates, and show that it can produce accurate results in applications such as node separation, node centrality, and ranked social search.