The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Fast shortest path distance estimation in large networks
Abstract
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landmarks and computing offline the distances from each node in the graph to those landmarks. At runtime, when the distance between a pair of nodes is needed, it can be estimated quickly by combining the precomputed distances. We prove that selecting the optimal set of landmarks is an NP-hard problem, and thus heuristic solutions need to be employed. We therefore explore theoretical insights to devise a variety of simple methods that scale well in very large networks. The efficiency of the suggested techniques is tested experimentally using five real-world graphs having millions of edges. While theoretical bounds support the claim that random landmarks work well in practice, our extensive experimentation shows that smart landmark selection can yield dramatically more accurate results: for a given target accuracy, our methods require as much as 250 times less space than selecting landmarks at random. In addition, we demonstrate that at a very small accuracy loss our techniques are several orders of magnitude faster than the state-of-the-art exact methods. Finally, we study an application of our methods to the task of social search in large graphs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 1×
“Finally, community detection has received interest in physics and sociology [16, 19, 33, 44].”
BackgroundFinding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
A Simple General Approach to Inference About the Tail of a Distribution
Hill, B. M. (1975) · The Annals of Statistics · doi:10.1214/aos/1176343247 · Cited by 3,086
A Greedy Heuristic for the Set-Covering Problem
Chvatal, V. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.3.233 · Cited by 2,581
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Fast Random Walk with Restart and Its Applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.70 · Cited by 1,184
Vivaldi: a decentralized network coordinate system
Dabek, F., Cox, R., Kaashoek, F., & Morris, R. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015471 · Cited by 1,154
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
Predicting Internet network distance with coordinates-based approaches
Ng, T. S. E., & Zhang, H. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019258 · Cited by 1,050
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
Optimal aggregation algorithms for middleware
Fagin, R., Lotem, A., & Naor, M. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00026-6 · Cited by 942
Inferring Web communities from link topology
Gibson, D., Kleinberg, J., & Raghavan, P. (1998) · Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems links, objects, time and space---structure in hypermedia systems - HYPERTEXT '98 · doi:10.1145/276627.276652 · Cited by 768
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
On lipschitz embedding of finite metric spaces in Hilbert space
Bourgain, J. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02776078 · Cited by 560
Approximating Betweenness Centrality
Bader, D. A., Kintali, S., Madduri, K., & Mihail, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_10 · Cited by 340
Virtual landmarks for the internet
Tang, L., & Crovella, M. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948223 · Cited by 297
Yes, there is a correlation: - from social networks to personal behavior on the web
Singla, P., & Richardson, M. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367586 · Cited by 294
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
Goldberg, A. V., Kaplan, H., & Werneck, R. F. (2006) · 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972863.13 · Cited by 247
Properties of embedding methods for similarity searching in metric spaces
Hjaltason, G. R., & Samet, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195989 · Cited by 216
Discovering leaders from community actions
Goyal, A., Bonchi, F., & Lakshmanan, L. V. S. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458149 · Cited by 182
Self-citationExact and Approximate Distances in Graphs — A Survey
Zwick, U. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44676-1_3 · Cited by 176
Natural communities in large linked networks
Hopcroft, J. E., Khan, O., Kulis, B., & Selman, B. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956816 · Cited by 143
Triangulation and Embedding Using Small Sets of Beacons
Kleinberg, J. M., Slivkins, A., & Wexler, T. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.70 · Cited by 129
Efficient network aware search in collaborative tagging sites
Amer-Yahia, S., Benedikt, M., Lakshmanan, L. V. S., & Stoyanovich, J. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453934 · Cited by 120
Towards Scaling Fully Personalized PageRank
Fogaras, D., & Rácz, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30216-2_9 · Cited by 84 · cited 1×
“Approximation methods for computing other graph proximity functions that are based on random walks, such as personalized pagerank and random walk with restart, have also been studied recently [ 14 , 33].”
MethodMetric Embeddings with Relaxed Guarantees
Abraham, I., Bartal, Y., Chan, T.-H. H., Dhamdhere, K., Gupta, A., Kleinberg, J. M., Neiman, O., & Slivkins, A. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.51 · Cited by 78
Efficiently indexing shortest paths by exploiting symmetry in graphs
Xiao, Y., Wu, W., Pei, J., Wang, W., & He, Z. (2009) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1516360.1516418 · Cited by 69
Using structure indices for efficient approximation of network properties
Rattigan, M. J., Maier, M. E., & Jensen, D. D. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150443 · Cited by 66
Reference-based indexing of sequence databases
Venkateswaran, J., Lachwani, D., Kahveci, T., & Jermaine, C. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164205 · Cited by 47
Searching the wikipedia with contextual information
Ukkonen, A., Castillo, C., Donato, D., & Gionis, A. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458274 · Cited by 36
Self-citation
Cited by
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Akiba, T., Iwata, Y., & Yoshida, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2465315 · Cited by 400
Metadata
- Authors
- Potamias, M., Bonchi, F., Castillo, C., & Gionis, A.
- Venue
- Proceedings of the 18th ACM conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2009-11-02
- Pages
- 867-876
- OpenAlex
- W2172107427
- Cited by
- 291
- References
- 40
- FWCI
- 16.90
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.