In the subcritical regime m = m_c(1-ε) with ε→0 and ε³n→∞, the largest component L1 satisfies L1 = (1+o_p(1)) * [2(α+2)/(α+1)] ε^{-2} log(ε³ n) for fixed α>0 (and analogous limits when α(n)→a).
A critical point for random graphs with a given degree se- quence.Random Structures & Algorithms, 6(2–3):161–180, 1995
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
A network model of cross-feeding in microbial communities reveals tipping points causing sudden diversity loss, with unculturability emerging as a network property.
Pedagogical review of the cavity equations, order parameter, and critical behavior for Anderson localization on the Bethe lattice.
A survey of existing measures and models for quantifying and generating higher-order homophily and heterophily in hypergraphs.
citing papers explorer
-
Sharp Asymptotics for the Largest Component in the Subcritical Regime of Preferential Attachment Without Vertex Growth
In the subcritical regime m = m_c(1-ε) with ε→0 and ε³n→∞, the largest component L1 satisfies L1 = (1+o_p(1)) * [2(α+2)/(α+1)] ε^{-2} log(ε³ n) for fixed α>0 (and analogous limits when α(n)→a).