On the External Validity of Average-Case Analyses of Graph Algorithms
Authors:
- Thomas BläsiusTBThomas Bläsius
- Philipp FischbeckPFPhilipp Fischbeck
Preprint
Abstract
The number one criticism of average-case analysis is that we do not actually know the probability distribution of real-world inputs. Thus, analyzing an algorithm on some random model has no implications for practical performance. At its core, this criticism doubts the existence of external validity, i.e., it assumes that algorithmic behavior on the somewhat simple and clean models does not translate beyond the models to practical performance real-world input. With this paper, we provide a first step towards studying the question of external validity systematically. To this end, we evaluate the performance of six graph algorithms on a collection of 2740 sparse real-world networks depending on two properties; the heterogeneity (variance in the degree distribution) and locality (tendency of edges to connect vertices that are already close). We compare this with the performance on generated networks with varying locality and heterogeneity. We find that the performance in the idealized setting of network models translates surprisingly well to real-world networks. Moreover, heterogeneity and locality appear to be the core properties impacting the performance of many graph algorithms.Keywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Solving Vertex Cover in Polynomial Time on Hyperbolic Random GraphsTheory of Computing Systems, 2021
- Understanding the Effectiveness of Data Reduction in Public Transportation Networks2019
- Parameterized Algorithms2015
- Listing All Maximal Cliques in Large Sparse Real-World Graphs2011
- Finding the Diameter in Real-World GraphsLecture Notes in Computer Science, 2010
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010
- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm2005
- Connected Components in Random Graphs with Given Expected Degree SequencesAnnals of Combinatorics, 2002
- A general theory of bibliometric and other cumulative advantage processesJournal of the American Society for Information Science, 1976
- Reducibility among Combinatorial Problems1972