# Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time

@inproceedings{Fichtenberger2020SamplingAS, title={Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time}, author={Hendrik Fichtenberger and Mingze Gao and Pan Peng}, booktitle={ICALP}, year={2020} }

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… CONTINUE READING

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 23 REFERENCES