Busy-probability comparison between the true system and mean-field approximations

Let

bebelowthestabilitythresholdbe below the stability threshold

. Denote by (q>0)(q>0), MF1(q>0)^{\mathrm{MF1}}(q>0), and MF2(q>0)^{\mathrm{MF2}}(q>0) the stationary busy probabilities of the original system and the Mean-Field 1 and Mean-Field 2 approximations, respectively.

Mean-field busy-probability comparison. For <<,

MF2(q>0)(q>0)MF1(q>0).^{\mathrm{MF2}}(q>0)\leq (q>0)\leq ^{\mathrm{MF1}}(q>0).

Thus Mean-Field 1 overestimates the stationary busy probability, whereas Mean-Field 2 underestimates it. The comparison quantifies the relative congestion predicted by the two approximations, but the supplied text does not establish whether the claim is proved or remains conjectural.

Sources & referencesView supporting material

Primary source

Philippe Sarotte, Nahuel Soprano-Loto and François Baccelli, “Interference Queueing Networks: A Replica Mean-Field Approach in the Symmetric Setting”, arXiv:2606.13264 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.