ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a network with nn layers, with LkL_k agents in layer kk, independent random connections between consecutive layers, and each connection equally probable. Let s^ideal\hat{s}_\text{ideal} denote the ideal final estimate. As the total number of agents increases, suppose the layer sizes satisfy

Lk≤Lk+1for 1≤k<n−1.L_k\leq L_{k+1}\quad\text{for }1\leq k<n-1.

Multilayer random-network conjecture. Under these conditions,

P(s^=s^ideal)→1.P(\hat{s}=\hat{s}_\text{ideal})\to 1.

Conversely, if L1>LkL_1>L_k for some 1<k<n1<k<n, then

P(s^=s^ideal)→0.P(\hat{s}=\hat{s}_\text{ideal})\to 0.

The conjecture extends the paper's three-layer random-network result to more than three layers. Simulations for four-layer networks are reported as supporting evidence, while a general proof is not provided.

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.