Fetching the paper…
Reading the bibliography…
In this work, we consider the problem of sampling a $k$-clique in a graph from an almost uniform distribution in sublinear time in the general graph query model.
Decomposition of finite graphs into forests
C. St. JA. Nash-Williams · 1964
Earlier work this paper cites.
On self-transformable combinatorial problems
C. P. Schnorr · 1981
Earlier work this paper cites.
Random generation of combinatorial structures from a uniform distribution
Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani · 1986
Earlier work this paper cites.
On sums of independent random variables with unbounded variance and estimating the average degree in a graph
Uriel Feige · 2006
Earlier work this paper cites.
Approximating average parameters of graphs
Oded Goldreich and Dana Ron · 2008
Earlier work this paper cites.
Counting stars and other small subgraphs in sublinear-time
Mira Gonen, Dana Ron, and Yuval Shavitt · 2011
Earlier work this paper cites.
Approximately counting triangles in sublinear time
Talya Eden, Amit Levi, Dana Ron, and C Seshadhri · 2015
Earlier work this paper cites.
Edge estimation with independent set oracles
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, and Makrand Sinha · 2017
Cited alongside, same era.
Sublinear-time algorithms for counting star subgraphs via edge sampling
Maryam Aliakbarpour, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, and Anak Yodpinyanee · 2018
Cited alongside, same era.
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna · 2018
Cited alongside, same era.
Lower bounds for approximating graph parameters via communication complexity
Talya Eden and Will Rosenbaum · 2018
Cited alongside, same era.
On sampling edges almost uniformly
Talya Eden and Will Rosenbaum · 2018
Cited alongside, same era.
The arboricity captures the complexity of sampling edges
Talya Eden, Dana Ron, and Will Rosenbaum · 2019
Later among the works it cites.
Sublinear time estimation of degree distribution moments: The arboricity connection
Talya Eden, Dana Ron, and C. Seshadhri · 2019
Later among the works it cites.
Approximately counting and sampling small witnesses using a colourful decision oracle
Holger Dell, John Lapinskas, and Kitty Meeks · 2020
Closest in time.
Faster sublinear approximation of the number of k -cliques in low-arboricity graphs
Talya Eden, Dana Ron, and C. Seshadhri · 2020
Closest in time.
On approximating the number of k k -cliques in sublinear time
Talya Eden, Dana Ron, and C. Seshadhri · 2020
Closest in time.
Sampling arbitrary subgraphs exactly uniformly in sublinear time
Hendrik Fichtenberger, Mingze Gao, and Pan Peng · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra · 2019
Cited alongside, same era.
Nearly optimal edge estimation with independent set queries
Xi Chen, Amit Levi, and Erik Waingarten · 2019
Cited alongside, same era.
Closest in time.
Sampling an edge uniformly in sublinear time
Jakub Tětek · 2020
Closest in time.