Answers are grounded in this paper and cite their sources.
In the bilateral preference random graph $LK(n,k)$ of La and Kabkab, independent uniform scores are placed on the edges of Kₙ, each vertex prefers its k incident edges of smallest score, and an edge is kept when both of its endpoints prefer it. Dabirian and Subramanian asked for the limiting distribution of the standardized degree (D- E D)/√Var D of a vertex. We show that if k→∞ and n-k→∞, then (k-D)/sₙ, where sₙ²=k(n-k)/n, converges in distribution and in its first two moments to φ(Z)+ZΦ(Z) with Z standard normal. Consequently E D=k-sₙ/√π+o(sₙ), Var D=(1/3+(√3-2)/(2π))sₙ²+o(sₙ²), and the standardized degree converges to an explicit law that is bounded above, hence not normal. If instead r=n-1-k≥1 is fixed, then $k-D$ converges in distribution and in all moments to a mixed Poisson variable whose mean is an explicit function of a gamma variable with shape r. These limits depend on r and, after standardization, converge to the interior law as r→∞. Together with the Erlang weighted tree of Moharrami, Subramanian, Liu and Sundaresan for fixed k, this identifies every subsequential limit of the standardized degree; no single law serves for all sequences $k(n)$. We also show that E(k-D) takes the same value at the budgets k and $n-1-k$ for every n.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: