Before revision: We present a simple sublinear-time algorithm for sampling an arbitrary subgraph H 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.
After revision: We present a simple sublinear-time algorithm for sampling an arbitrary subgraph H exactly uniformly from a graph G with m edges , 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.