ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Construct the locally finite connected rooted random graph G∙G^\bullet from the partially labeled rooted random tree T∙T^\bullet as described in the source: even-generation vertices have offspring distribution Poi⁡(λ)\operatorname{Poi}(\lambda), odd-generation vertices carry independent XX-biased labels (X∗,Q∗)(X^*,Q^*) and have X∗−1X^*-1 children, and edges between even-generation vertices are retained according to the independent Bernoulli variables attached to odd-generation layers. Local weak limit conjecture. Under sufficient regularity, G∙G^\bullet is a local weak limit of the random intersection graph model. This conjecture identifies the rooted tree construction as the local limit of the model; the source does not specify the regularity assumptions or give a resolution.

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.