The local weak limit conjecture for random intersection graphs
Statement
Construct the locally finite connected rooted random graph from the partially labeled rooted random tree as described in the source: even-generation vertices have offspring distribution , odd-generation vertices carry independent -biased labels and have 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, 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.