ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each nn, let Dn\mathcal{D}_n be a distribution over graphs of nn vertices. A projective sampling scheme is as follows. For any k<nk < n we have a procedure to, given a sample from Dn\mathcal{D}_n, choose kk vertices so that the induced subgraph is distributed according to Dk\mathcal{D}_k. We would like interesting examples of such sampling schemes for sparse graphs. More generally, we may not require the parameter nn to be the number of vertices. One example is taking a sub-box for random geometric graphs. Graphons use the sampling scheme of selecting kk 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.