Projective sampling scheme for sparse graphs
Statement
For each , let be a distribution over graphs of vertices. A projective sampling scheme is as follows. For any we have a procedure to, given a sample from , choose vertices so that the induced subgraph is distributed according to . We would like interesting examples of such sampling schemes for sparse graphs. More generally, we may not require the parameter to be the number of vertices. One example is taking a sub-box for random geometric graphs. Graphons use the sampling scheme of selecting vertices uniformly at random.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.