Let's say I have a very large graph that proves impractical for visualization ends and I wanted to sample a random subgraph.
(I know that I can filter out a subgraph via measures like degree, components, weights... but this is not my point)
Is there any procedure that I can use to get a random sample from the graph?
I see that the igraph
package has two sampling functions that seem however to be generic and not specifically designed for sampling graphs. But if they are in that package there must be a reason!
(Is it as easy as random sampling edges i.e. rows?)