Brief Announcement: How Large is your Graph?
Pages 195 - 197
Abstract
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/(||π||2) + 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).
References
[1]
Michael A. Bender and Data Ron. 2002. Testing properties of directed graphs: Acyclicity and connectivity. Random Structures and Algorithms 20, 2 (2002), 184--205.
[2]
Béla Bollobás. 1980. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs. European Journal of Combinatorics 1, 4 (1980), 311 -- 316. 0195--6698 https://doi.org/10.1016/S0195--6698(80)80030--8
[3]
Colin Cooper and Alan Frieze. 2002. Crawling on web graphs. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. ACM, 419--427.
[4]
Colin Cooper, Tomasz Radzik, and Yiannis Siantos. 2012. Estimating network parameters using random walks. In Computational Aspects of Social Networks, 4th International Conference on. 33--40.
[5]
Artur Czumaj, Pan Peng, and Christian Sohler. 2016. Relating Two Property Testing MOdels for Bounded Degree Directed Graphs. In Proceedings of the ACM Symposium on the Theory of Computing (STOC).
[6]
Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós. 2014. On estimating the average degree. In Proceedings of the 23rd international conference on World Wide Web. ACM, 795--806. https://doi.org/10.1145/2566486.2568019
[7]
Oded Goldreich. 2010. Introduction to Testing Graph Properties. Survey article available at http://www.wisdom.weizmann.ac.il/ oded/COL/tgp-intro.pdf. (2010).
[8]
Liran Katzir and Stephen J. Hardiman. 2015. Estimating Clustering Coefficients and Size of Social Networks via Random Walk. ACM Transactions on the Web 9, 4, Article 19 (2015), 20 pages. 1559--1131
[9]
Liran Katzir, Edo Liberty, Oren Somekh, and Ioana A. Cosma. 2014. Estimating Sizes of Social Networks via Biased Sampling. Internet Mathematics 10, 3--4 (2014), 335--359. https://doi.org/10.1080/15427951.2013.862883
[10]
Donald E. Knuth. 1975. Estimating the efficiency of backtrack programs. Mathematics of computation 29, 129 (1975), 122--136.
[11]
Alberto Marchetti-Spaccamela. 1988. On the estimate of the size of a directed graph. In International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 317--326.
[12]
Cameron Musco, Hsin-Hao Su, and Nancy A. Lynch. 2016. Ant-Inspired Density Estimation via Random Walks: Extended Abstract. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25--28, 2016. 469--478.
[13]
Leonard Pitt. 1987. A note on extending Knuth's tree estimator to directed acyclic graphs. Information processing letters 24, 3 (1987), 203--206.
[14]
Gregory Valiant and Paul Valiant. 2011. Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. In Proceedings of the forty-third annual ACM symposium on Theory of computing. ACM, 685--694.
[15]
Gregory Valiant and Paul Valiant. 2013. Estimating the unseen: improved estimators for entropy and other properties. In Advances in Neural Information Processing Systems. 2157--2165.
Index Terms
- Brief Announcement: How Large is your Graph?
Recommendations
Brief announcement: maintaining large dense subgraphs on dynamic networks
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computingIn distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense ...
Brief Announcement: Tight Bounds for Repeated Balls-into-Bins
SPAA '22: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe study the repeated balls-into-bins process introduced by Becchetti, Clementi, Natale, Pasquale and Posta [3]. This process starts with m balls arbitrarily distributed across n bins. At each step t = 1, 2, . . ., we select one ball from each non-empty ...
Biclique coloring game (Brief Announcement)
AbstractA biclique q-coloring is an assignment of q-colors to the vertices of a graph G, so that no biclique (maximal set of vertices that induces a complete bipartite subgraph of G with at least one edge) is monochromatic. Inspired by the coloring game, ...
Comments
Information & Contributors
Information
Published In
July 2017
480 pages
ISBN:9781450349925
DOI:10.1145/3087801
- General Chair:
- Elad Michael Schiller,
- Program Chair:
- Alexander A. Schwarzmann
Copyright © 2017 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 July 2017
Check for updates
Author Tags
Qualifiers
- Abstract
Conference
Acceptance Rates
PODC '17 Paper Acceptance Rate 38 of 154 submissions, 25%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 126Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in