Brief Announcement: How large is your graph?

Conference item

We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a seed node and is allowed to make queries about neighbours of nodes that have already been seen. In the case of undirected graphs, an estimator of Katzir et al. (2014) based on a sample from the stationary distribution π uses O 1 kπk2 +davg queries; we prove that this is tight. In addition, we establish this as a lower bound even when the algorithm is allowed to crawl the graph arbitrarily; the results of Katzir et al. give an upper bound that is worse by a multiplicative factor tmix·log(n). The picture becomes significantly different in the case of directed graphs. We show that without strong assumptions on the graph structure, the number of nodes cannot be predicted to within a constant multiplicative factor without using a number of queries that are at least linear in the number of nodes; in particular, rapid mixing and small diameter, properties that most real-world networks exhibit, do not suffice. The question of interest is whether any algorithm can beat breadth-first search. We introduce a new parameter, generalising the well-studied conductance, such that if a suitable bound on it exists and is known to the algorithm, the number of queries required is sublinear in the number of edges; we show that this is tight.

Authors: Kanade, V; Mallmann-Trenn, F; Verdugo, V

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Host title: PODC '17 Proceedings of the ACM Symposium on Principles of Distributed Computing
• Journal: PODC 2017
• Pages: 195-197
• Publication date: 2017-07-25
• Acceptance date: 2017-04-30
• DOI: 10.1145/3087801.3087855
• ISBN: 9781450349925
• Keywords: estimation; random walks; social networks