{"id":"043fda32-c281-47d4-8beb-6785233f50e7","arxiv_id":"2504.20030","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The multitype allele tree for a finite-allele neutral mutation model converges in the rare-mutation limit to Bertoin's universal allele tree with deterministic type labels.","lead":"This paper studies populations where children usually inherit their mother's gene type, and rare mutations switch them to another version from a finite list. It proves that the multitype family tree of these gene groups converges, after rescaling, to a known continuous random tree.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.1's scaling is inconsistent: non-root allele family sizes are O(n), so n^{-2}A_u converges to 0, contradicting the claimed positive limit Y_u from Definition 5.3 for every level-1 node.","rationale":"The reader's weakest assumption concerned the ordering equivalence in Section 6.6, but the more fundamental problem is the scaling of individual non-root nodes. The paper's own Lemma 5.1 and Proposition 5.2 establish convergence for the clone-mutant chain, which tracks sums over all families at a given allelic generation. Theorem 1.1, however, claims convergence for each node of the allele tree. Because a level-1 family is started by one mutant individual, its clone size is the total progeny of a subcritical branching process with mean 1 - c/n, hence of order n. The n^{-2} scaling used in the theorem sends every such family size to zero, while the asserted limit object has positive masses at infinitely many nodes. This is an internal inconsistency, not merely a missing proof: the displayed theorem cannot be true under its own definitions. The proof's appeal to [2, Theorem 1] may conceal this because Bertoin's universal allele tree in the infinite-alleles setting is stated with a different normalization and a different limiting object; the present paper does not adapt that scaling to the multitype tree. A corrected version would need either to rescale non-root masses by n^{-1} and identify the limiting point-process of family sizes, or to revise Definition 5.3 and the claimed limit accordingly. The clone-mutant chain results and the random-walk techniques in Sections 3 and 5 are plausible and may support such a corrected statement, but the central theorem as stated is not.","tokens_in":22080,"tokens_out":14480,"duration_ms":154983,"concrete_test":"Use the random-walk identity in Lemma 3.5 to compute the limit of the Laplace transform of n^{-2}T_0^{(n)} for a process starting from one individual of type i. Concretely, show that E_{e_i}^{r(n)} exp(-lambda n^{-2} T_0^{(n)}) tends to 1 for every lambda > 0, so n^{-2}T_0^{(n)} -> 0 in probability, while for the claimed limit Y_u one has E exp(-lambda Y_u) < 1 for lambda > 0. This directly contradicts the level-1 finite-dimensional convergence in Theorem 1.1. Alternatively, simulate a critical offspring distribution with sigma^2 = 1, e.g. P(offspring = 0) = P(offspring = 2) = 1/4 and P(offspring = 1) = 1/2, take r(n) = c/n, and check numerically that n^{-2} times the largest level-1 clone family size tends to 0 as n grows.","verdict_should_be":"REJECT","load_bearing_attack":"The proof of Theorem 1.1 in Section 6.6 derives the statement from Lemma 5.1, but the theorem's scaling cannot hold for non-root nodes. Lemma 5.1 gives n^{-2}T_0^{(n)} -> theta_1 and n^{-1}M_1^{(n)} -> (c/(d-1))theta_1 sum_{i != j} e_i; these are the root data. For a level-1 node u, A_u is the clone family size started by a single mutant individual. By Lemma 3.5 and Proposition 3.3(i), under P^{r(n)}_{e_i} this size has the law of the first hitting time tau_0 of 0 by a random walk whose step has mean -r(n) = -c/n + o(1/n) and variance sigma^2 + o(1). Hence tau_0 is of order n, not n^2: n^{-1}tau_0 converges to an inverse Gaussian law and n^{-2}tau_0 -> 0 in probability. Equivalently, n^{-2}A_u -> 0 and n^{-1}d_u -> 0 for every level-1 node u, since d_u counts O(1) mutant children of a clone family of size O(n). But the limit claimed in Theorem 1.1 has Y_u > 0 for the first-ranked atoms at every level, because Definition 5.3's reproduction measure nu has infinite total mass and finite integral of z nu(dz), so the Poisson atoms are positive infinitely often. Thus the finite-dimensional convergence asserted for |u| = 1 is false as stated. A correct statement would need n^{-1} scaling for non-root nodes and a different limiting object, not the positive tree-indexed CSBP of Definition 5.3.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the mother-dependent neutral mutations model with d alleles, where each mutant child acquires a type different from its mother, uniformly at random. It defines a multitype allele tree whose nodes record the sizes of clone subfamilies, their types, and their mutant offspring vectors. The main result, Theorem 1.1, claims that when the initial population consists of n individuals of one type, the mutation rate is r(n) ~ c/n, and the offspring distribution is critical with variance σ^2, the rescaled tree (n^{-2}A_u, C_u, n^{-1}d_u) converges in finite-dimensional distributions to Bertoin's universal tree-indexed CSBP with reproduction measure ν(dz) = c(2πσ^2 z^3)^{-1/2} exp(-c^2 z/(2σ^2)) dz and random initial population θ_1 ~ IG(1/c, 1/σ^2). The proof strategy is to analyze a clone-mutant Markov chain (Section 3), prove its scaling limit (Lemma 5.1, Proposition 5.2), and then argue that the allele tree inherits this limit (Section 6.6).","tokens_in":22468,"tokens_out":17718,"duration_ms":174275,"significance":"If the main theorem were correct, it would provide a finite-allele extension of Bertoin's universal allele tree and would be a valuable contribution to the scaling limits of branching structures with neutral mutations. The paper's auxiliary analysis is largely sound: the random-walk representation in Lemma 3.5 and the weak convergence proofs of Lemma 5.1 and Proposition 5.2 are carried out in detail, and the clone-mutant Markov chain is a natural and potentially reusable tool. However, the central theorem is internally inconsistent with the model's own scaling: non-root clone subfamilies have size of order n, not n^2, so the claimed convergence cannot hold as stated.","major_comments":[{"comment":"For any non-root node u, A_u^{(n)} is defined in Section 4 as the number of individuals in the clone subfamily rooted at a single mutant individual. Under P^{r(n)}_{e_i}, Lemma 3.5 identifies this size with the first hitting time τ_0 of 0 by a random walk with step mean -r(n) = -c/n + o(1/n) and variance σ^2 + o(1). Wald's identity gives E[A_u^{(n)}] = n/c + o(n), and the classical near-critical limit gives n^{-1} A_u^{(n)} ⇒ a nontrivial law, so n^{-2} A_u^{(n)} → 0 in probability. Similarly, d_u^{(n)} for a level-1 node has mean of order 1, so n^{-1} d_u^{(n)} → 0. However, the tree-indexed CSBP of Definition 5.3, with the intensity ν in (9) of infinite total mass, has positive atoms at every level almost surely. Hence the claimed finite-dimensional convergence to (Y_u) with Y_u > 0 for |u|=1 is false. The proof in Section 6.6 derives the theorem from Lemma 5.1, but that lemma concerns the aggregate root family T_0^{(n)}, which is of order n^2; it does not control the individual subfamily sizes, which are of order n. The assertion that 'Lemma 5.1 also implies' the convergence of the ordered atoms is therefore not justified and is in fact inconsistent with the model's own scaling.","section":"Theorem 1.1, Sections 1.2 and 6.6"},{"comment":"The proof of Theorem 1.1 asserts without proof that the ordering of allele-tree nodes defined in Section 4 (rank mothers by decreasing number of mutant children, then by type and subtree size) coincides in the limit with ranking the atoms of the Poisson random measure in Definition 5.3 in decreasing order, and that this order is almost surely well-defined with no ties. This is a load-bearing step for finite-dimensional convergence, because the ranking operation is not continuous in the product topology and the asserted tie-free property of the limiting Poisson atoms is not established. Section 6.6 provides no argument beyond citing 'arguments similar to those in [2, Theorem 1]'; given the additional type-ordering mechanism in Section 4, this is an essential gap.","section":"Section 6.6 and Definition 5.3"}],"minor_comments":[{"comment":"The statement says the model follows the law P^{r(n)}_{n^{-1} e_j} and 'starting with one indivivual of type j'; this should be P^{r(n)}_{n e_j} and 'starting with n individuals of type j'.","section":"Theorem 1.1, statement"},{"comment":"The exponential in the reproduction measure uses the variable y, which is undefined; it should be z, as in Definition 5.3.","section":"Equation (9)"},{"comment":"The text says 'the following convergence holds a.s.' followed by a weak convergence arrow; this should be convergence in distribution (functional CLT), not almost sure convergence.","section":"Section 6.4, around equation (33)"}],"recommendation":"reject","confidential_remarks":"The auxiliary results (Lemmas 5.1 and Proposition 5.2) appear sound and may be publishable on their own, but the main theorem is false as stated because of the n^2 vs n scaling mismatch for non-root nodes. A corrected version would require a different scaling for non-root nodes and a different limiting object, which is beyond the scope of a revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The stress-test note is right, and it kills the main theorem. For a level-1 node u, A_u is the clone family size of a single mutant. By the paper's own random walk representation (Lemma 3.5), this is the total progeny of a subcritical BGW with mean offspring 1 - r(n) ~ 1 - c/n, so it is O(n), not O(n^2). Consequently n^{-2}A_u -> 0, while the claimed limit Y_u is positive almost surely for the first-ranked atoms. The root is the only node whose size is O(n^2); the theorem incorrectly applies the root scaling to all nodes. Proposition 5.2 even shows T_k is O(n^2) at every level, but that is a sum over O(n) nodes each of size O(n)--not a contradiction, but it makes the finite-dimensional convergence of individual nodes at n^{-2} scaling impossible.\n\nWhat is genuinely good: the clone-mutant Markov chain in Section 3, Proposition 3.3 via Lagrange inversion, Lemma 3.5's random walk identity, and Lemma 5.1's convergence for the first transition starting from n individuals. These are proved carefully and look correct. The multitype allele tree construction in Section 4 is a natural extension of Bertoin's and is worth preserving in a revision. The paper also engages honestly with the literature; the cited prior work [3] is used only to define the model.\n\nThe soft spots are the scaling error in Theorem 1.1 and the sketchy Section 6.6 proof, which asserts the ordering equivalence without proof. Fixing the scaling would require n^{-1} for non-root sizes and would lead to a different limiting object, not the positive tree-indexed CSBP of Definition 5.3. So this is not a minor typo; the main result is false as stated.\n\nWho is this for? Anyone working on finite-allele analogues of Bertoin's rare-mutation trees. The intermediate results deserve serious attention, but Theorem 1.1 should not be cited. I would send this to a referee because the flaw is subtle and the machinery is nontrivial, but the referee will likely require a major rewrite or rejection. My recommendation: treat it as a paper to be reconsidered only after a substantial revision that rescales non-root nodes and reproves the limit.","headline":"The main theorem's scaling is wrong for every non-root node: level-1 allele family sizes are O(n), so n^{-2}A_u cannot converge to a positive limit; the paper's intermediate clone-mutant chain results are solid, but Theorem 1.1 as stated is false.","tokens_in":22981,"tokens_out":3907,"would_cite":false,"duration_ms":42055,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J80","60J85","60F05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Finite-allele populations with rare neutral mutations converge to a single universal allele tree.","keywords":["mother-dependent neutral mutations","multitype allele tree","tree-indexed continuous-state branching process","rare mutations scaling limit","inverse Gaussian distribution","clone-mutant Markov chain","finite-dimensional convergence","neutral mutations"],"falsifier":"The ordering equivalence can be settled by simulation or direct construction: for $d=2$, large $n$, and several values of $c$ and $\\sigma^2$, record the first allelic generation and compare the rank of a subfamily under the Section 4 priority rule with its rank by decreasing size. If the two orders differ on a set of positive limiting probability, the limit is not the ranked Poisson tree of Definition 5.3. A simpler margin to check is the one-dimensional law: if $n^{-2}T_0$ does not converge to the inverse Gaussian $\\mathrm{IG}(1/c,1/\\sigma^2)$, or $n^{-1}M_1$ does not converge to the constant allocation $\\frac{c}{d-1}\\theta_1$ on each other type, Theorem 1.1 is false.","tokens_in":21864,"feed_emoji":"🌳","tokens_out":10995,"duration_ms":98909,"temperature":0.7,"pith_summary":"The paper studies the genealogy of a population whose members carry one of finitely many alleles and in which each mutation changes the allele to a different type, chosen uniformly at random. It defines a multitype allele tree that records, for every allelic subfamily, its size, its allele type, and the numbers of mutant descendants of each type. The main result shows that when the branching process is critical, the mutation rate is $r(n)\\sim c/n$, and the initial population is of order $n$, the rescaled allele tree converges in finite-dimensional distributions to a tree-indexed continuous-state branching process (CSBP). In the limit, the initial clone subfamily has inverse Gaussian size $\\theta_1\\sim\\mathrm{IG}(1/c,1/\\sigma^2)$, and a subfamily of limiting size $Y_u$ produces $\\frac{c}{d-1}Y_u$ mutants of each of the other $d-1$ types. The limiting object is the same universal allele tree that governs the infinite-allele neutral-mutation model, so the finiteness of the allele set does not change the universality class.","feed_headline":"Rare mutations collapse into one universal allele tree","feed_subtitle":"Rescaled multitype allele trees meet a tree-indexed branching limit with inverse-Gaussian root sizes.","key_machinery":"The carrier of the argument is the clone–mutant Markov chain $((T_k,M_{k+1}))_{k\\ge 0}$: $T_k(i)$ is the number of type-$i$ individuals in allelic generation $k$ (the clone families), and $M_{k+1}(i)$ counts the type-$i$ mutants that start the next allelic generation. Its one-step transition is governed by the pair $(T_0,M_1)$ associated with a single ancestor. The proof converts this pair into a random-walk object: $T_0(i)$ is the first hitting time $\\tau_0$ of level zero by the breadth-first random walk that codes the type-$i$ subtree, and $M_1$ is the total mutant offspring accumulated along that walk; the transition law then follows from a generating-function inversion formula. In the scaling limit the random walk converges to a Brownian motion with drift, so the hitting time becomes the inverse Gaussian $\\theta_1$ and the offspring structure becomes the ranked atoms of a Poisson random measure with intensity $Y_u\\nu(dz)$. The allele tree itself is assembled by a recursive priority rule: rank mothers by decreasing number of mutant children, then by increasing type, then by decreasing subtree size.","core_discovery":"The central claim is Theorem 1.1: starting from $n$ individuals of a single type $j$, rescale the allele tree $A^{(n)}$ as $(n^{-2}A^{(n)}_u,\\,C^{(n)}_u,\\,n^{-1}d^{(n)}_u)_{u\\in\\mathbb{U}}$. Under hypotheses (H2) and (H3), namely mutation rate $r(n)\\sim c/n$ and a critical offspring law with finite variance $\\sigma^2$, this rescaled tree converges in the sense of finite-dimensional distributions to $\\big(Y_u,\\,C_u,\\,\\frac{c}{d-1}Y_u\\sum_{i\\neq C_u}e_i\\big)_{u\\in\\mathbb{U}}$. Here $(Y_u)_{u\\in\\mathbb{U}}$ is a tree-indexed CSBP with reproduction measure $\\nu(dz)=\\frac{c}{\\sqrt{2\\pi\\sigma^2 z^3}}\\exp\\!\\big(-\\frac{c^2 z}{2\\sigma^2}\\big)dz$ and random root value $\\theta_1\\sim\\mathrm{IG}(1/c,1/\\sigma^2)$, the first-passage time of a Brownian motion with drift $c$. The limiting object is the universal allele tree introduced in the infinite-allele setting; the finite-allele model changes only the allocation of mutants across types. If the initial population contains all types in proportions $y(i)$, the result extends to a forest of such tree-indexed CSBPs, one for each initial type.","pith_inferences":["The linear factor $c/(d-1)$ is a concrete finite-allele correction that could be looked for in population-genetic data: under rare neutral mutations, the relative mutant counts on the other $d-1$ alleles should be exchangeable with ratio fixed by $c$, independent of $\\sigma^2$.","A natural extension the paper does not treat lets the number of alleles grow with $n$; if $d(n)\\to\\infty$, the factor $c/(d-1)$ suggests convergence to a continuum-of-types object, possibly the infinite-allele universal tree again.","The unproved ordering equivalence in Section 6.6 could be tested by an explicit coupling of the recursive allele-tree order with the decreasing-size ranking of Poisson atoms; if it fails for one tie-breaking rule, the theorem may still hold after modifying the priority rule."],"forward_implications":["Large allelic subfamilies in the rare-mutation limit have sizes governed by the stable $1/2$ reproduction measure $\\nu(dz)$, so the infinite-allele universality class persists with finitely many alleles.","The limiting mutant counts of a subfamily of size $Y_u$ and type $C_u$ are exactly $(c/(d-1))Y_u$ for each other type; the allele set only rescales the mutant vector, it does not alter the branching structure.","The whole clone–mutant chain converges to a continuous-state Markov chain whose transition cumulant is $\\kappa_j(x,z)=\\kappa(x(j)+\\frac{c}{d-1}\\sum_{i\\ne j}z(i))$, so allelic generations remain Markovian in the limit.","With all types present initially, the limit is a forest of independent tree-indexed CSBPs, one per initial type, with independent inverse Gaussian root sizes."],"supporting_citations":[{"why":"Provides the background theory of the allelic partition of a branching process with neutral mutations, which the paper's finite-allele extension builds on.","marker":"[1]"},{"why":"Defines the universal allele tree and its scaling limit in the infinite-allele case; Theorem 1.1 is the multidimensional finite-allele analogue.","marker":"[2]"},{"why":"Introduces the mother-dependent neutral mutations model analysed here.","marker":"[3]"},{"why":"Supplies the breadth-first random-walk coding of multitype forests used to identify the law of $(T_0,M_1)$.","marker":"[5]"},{"why":"Gives the total-progeny formula that converts the clone-family size into a random-walk first hitting time.","marker":"[7]"},{"why":"Provides the general branching property for stopping lines, used to prove that the clone–mutant chain is Markov.","marker":"[8]"},{"why":"States the multiplicative-process total-progeny formula that Proposition 3.3 generalises.","marker":"[12]"},{"why":"Supplies the genealogical labeling and the generating-function inversion tool used in the transition-law computation.","marker":"[13]"}],"fun_headline_variants":["Allele trees under rare mutations share a universal limit","Rare mutation allele trees converge to a universal tree","Finite allele trees meet Bertoin's universal tree","Allele tree scaling limit is a tree-indexed CSBP"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the deterministic bookkeeping order used to list allelic subfamilies—largest mutant families first, ties broken by type and then by subtree size—coincides after rescaling with the decreasing-size ranking of the limiting Poisson atoms, and that the induction over levels of the genealogical index tree is legitimate for finite-dimensional convergence; Section 6.6 assumes this without a separate proof.","fun_headline_variants_meta":{"raw":{"variants":["Allele trees under rare mutations share a universal limit","Rare mutation allele trees converge to a universal tree","Finite allele trees meet Bertoin's universal tree","Allele tree scaling limit is a tree-indexed CSBP"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000759,"raw_usage":{"total_tokens":3393,"prompt_tokens":989,"completion_tokens":2404,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":605,"completion_tokens_details":{"reasoning_tokens":2339}},"tokens_in":605,"tokens_out":2404,"duration_ms":20557,"temperature":1.0,"reasoning_tokens":2339,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T05:37:01.970566+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"The ordering equivalence can be settled by simulation or direct construction: for $d=2$, large $n$, and several values of $c$ and $\\sigma^2$, record the first allelic generation and compare the rank of a subfamily under the Section 4 priority rule with its rank by decreasing size. If the two orders differ on a set of positive limiting probability, the limit is not the ranked Poisson tree of Definition 5.3. A simpler margin to check is the one-dimensional law: if $n^{-2}T_0$ does not converge to the inverse Gaussian $\\mathrm{IG}(1/c,1/\\sigma^2)$, or $n^{-1}M_1$ does not converge to the constant allocation $\\frac{c}{d-1}\\theta_1$ on each other type, Theorem 1.1 is false.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the background theory of the allelic partition of a branching process with neutral mutations, which the paper's finite-allele extension builds on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the universal allele tree and its scaling limit in the infinite-allele case; Theorem 1.1 is the multidimensional finite-allele analogue."},{"cited_title":"Crossing bridges between percolation models and Bienaym\\'e-Galton-Watson trees","cited_arxiv_id":"2411.09621","evidence_quote":"Introduces the mother-dependent neutral mutations model analysed here."},{"cited_title":"Chaumont and R","cited_arxiv_id":null,"evidence_quote":"Supplies the breadth-first random-walk coding of multitype forests used to identify the law of $(T_0,M_1)$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the general branching property for stopping lines, used to prove that the clone–mutant chain is Markov."},{"cited_title":"Pitman.Combinatorial stochastic processes: Ecole d’et´ e de probabilit´ es de Saint-Flour XXXII-2002","cited_arxiv_id":null,"evidence_quote":"Supplies the genealogical labeling and the generating-function inversion tool used in the transition-law computation."}],"review_version":1}