# Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time

@inproceedings{Fichtenberger2020SamplingAS,
title={Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time},
author={Hendrik Fichtenberger and M. Gao and Pan Peng},
booktitle={ICALP},
year={2020}
}
• Published in ICALP 2020
• Mathematics, Computer Science
We present a simple sublinear-time algorithm for sampling an arbitrary subgraph $H$ \emph{exactly uniformly} from a graph $G$, to which the algorithm has access by performing the following types of queries: (1) uniform vertex queries, (2) degree queries, (3) neighbor queries, (4) pair queries and (5) edge sampling queries. The query complexity and running time of our algorithm are $\tilde{O}(\min\{m, \frac{m^{\rho(H)}}{\# H}\})$ and $\tilde{O}(\frac{m^{\rho(H)}}{\# H})$, respectively, where… Expand
2 Citations

#### References

SHOWING 1-10 OF 26 REFERENCES
On Sampling Edges Almost Uniformly
• Computer Science, Mathematics
• SOSA
• 2018
The Arboricity Captures the Complexity of Sampling Edges
• Mathematics, Computer Science
• ICALP
• 2019
Approximately Counting Triangles in Sublinear Time
• Computer Science, Mathematics
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
Approximating average parameters of graphs
• Mathematics, Computer Science
• Random Struct. Algorithms
• 2008