History of k-core thresholds of the Erdős–Rényi random graph

back to table · edit · history · where entries came from · files

compare when who what
2026-09-07 01:45 bmatschke tagged "statistical mechanics": six tables on critical phenomena carried only "physics" and "combinatorics", which does not distinguish them from anything current reviewed
2026-09-06 13:33 bmatschke the arXiv number of 1 references was in the sentence, where it is text; moved to the `arxiv` field, which the page renders as a link to the abstract
2026-09-06 08:03 zeta3 after the critique: "of order n" (which reads as all n vertices) is now "on a positive fraction of the vertices" in the definition and in the history comment; Janson's coauthor is Luczak, no stroke; the 2-core quotient "tends to 1 as lambda -> 0 and increases"; "the same minimisation" names what it
2026-09-06 07:50 zeta3 definition shortened to the object and the formula, with G(n,m) left to the comment on the models; "above c_k" reworded to "for c > c_k", since the audit refuses positional words and this one read as one
2026-09-06 07:47 zeta3 with Claude Code, table-build@bc7 k-core thresholds c_k of the random graph G(n, c/n) for 3 <= k <= 12, the minimum of x / P(Poisson(x) >= k-1) enclosed in ball arithmetic at 100 digits from a bisection bracket around its unique minimiser
2026-09-06 07:47 zeta3 checking that this table can be written to
2026-09-06 07:46 zeta3 draft: k-core thresholds of the random graph, proposal 6 of the 2026-09-06 batch, prose first

What changed between 2026-09-06 13:33 and 2026-09-07 01:45

from line 97 (5 lines, 1 more than before) @@ -97,4 +97,5 @@
       & Algorithms 27 (2005), 124–135. Tags:+- statistical mechanics - probability theory - combinatorics 

Sign in to restore an earlier version.