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).
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Proves that graphs on N ≥ 2n vertices with δ(G) ≥ ⌊3N/4⌋ have every 2-edge-coloring containing a monochromatic copy of every n-vertex tree with max degree ≤ Δ.
Sparse antagonistic random matrices with diagonal disorder and Jacobian structure show five spectral phases; the population dynamics algorithm underestimates spectral support under strong disorder.
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).
-
A degree version of the Burr-Erd\H{o}s conjecture on trees
Proves that graphs on N ≥ 2n vertices with δ(G) ≥ ⌊3N/4⌋ have every 2-edge-coloring containing a monochromatic copy of every n-vertex tree with max degree ≤ Δ.
-
Spectral properties and phase diagrams of sparse antagonistic random matrices with diagonal disorder and Jacobian-like structure
Sparse antagonistic random matrices with diagonal disorder and Jacobian structure show five spectral phases; the population dynamics algorithm underestimates spectral support under strong disorder.