{"id":"922b8a3a-6b55-437e-9186-e176455a7db9","arxiv_id":"2504.16976","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"In the loop soup on the complete graph K_n, the number of clusters of size d converges to a mixed Poisson law with mixing variable exp(-dZ/κ), and clusters larger than n^{1-ε} appear almost surely.","lead":"This paper derives exact formulas and asymptotic limits for the sizes of clusters in a Poisson loop soup on complete graphs. It shows that small clusters have a Poisson mixture limit and that very large clusters almost surely exist.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 5's mixed Poisson law has factorial moments (κ/(kd+κ))^α, whereas Proposition 3 plus Lemma 2 yield (α/d)^k(κ/(kd+κ))^α; for d≥2 the stated limit distribution is not the limit.","rationale":"The reader's weakest assumption concerns the independence and self-similarity step inside Proposition 3. That step is standard for Poisson loop soups and is not where the argument breaks in the written text. The more exposed point is the final passage from factorial moments to Proposition 5: the moment sequence derived from Propositions 3 and Lemma 2 does not match the factorial moments of the law displayed in Proposition 5. This is not merely a missing justification for a moment-convergence theorem; it is an internal inconsistency in the central claim. The factor (α/d)^k may be repairable by redefining the mixing variable H_α as (α/d)exp(−dZ_α/κ), and the density for α = 1 would then change accordingly. Because the framework and the asymptotic factorial moments appear sound, a conditional verdict with a mandatory correction is appropriate rather than outright rejection.","tokens_in":5145,"tokens_out":25328,"duration_ms":240087,"concrete_test":"Specialize to d=2, α=1, κ=1. From Eq. (1)–(2), compute the exact probability that a fixed pair {x,y} is a cluster as P_n = [c_2(n)/m_2(n)] [m_2(n)m_{n−2}(n)/m_n(n)], with m_r(n) = (1−r/(n+1))^{−1} and c_2(n) the second cumulant of Y^{(1)}. Let n → ∞: if P_n → 1/3, Proposition 3's α/d factor is wrong; if P_n → 1/6, Proposition 5's stated mean κ/(κ+d) = 1/3 is wrong and the correct mixing variable for d=2 is (1/2)e^{−2Z}. Either outcome falsifies one of Propositions 3, Lemma 2, or Proposition 5 as written.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"In Proposition 3, E[(|I_d|)_k] is the product of k binomial coefficients, [c_d^α]^k, and (κ/(kd+κ))^α. Lemma 2 gives c_d^α ∼ α(d−1)! n^{−d}, and the binomial product is ∼ n^{kd}/(d!)^k, so the factorial moments of |I_d| converge to (α/d)^k(κ/(kd+κ))^α. Proposition 5 asserts convergence to a mixed Poisson law with H_α = exp(−dZ_α/κ); that law has factorial moments E[H_α^k] = (κ/(kd+κ))^α. The two moment sequences differ by the factor (α/d)^k for every k. For d=1 the discrepancy is masked because c_1 → 1 rather than α/n, but for every d ≥ 2 it is present. The displayed α = 1 density (κ/d)x^{κ/d−1} confirms that the stated mixing variable has no α/d factor. Thus Proposition 5 does not follow from the preceding asymptotics: either Proposition 3 or Lemma 2 is missing a factor, or the mixing variable in Proposition 5 must be (α/d)exp(−dZ_α/κ). Since Proposition 5 is the central result, this is load-bearing.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the random partition C_alpha of the complete graph K_n induced by a Poissonian ensemble of Markov loops of intensity alpha, with unit conductances and constant killing kappa. Building on the author's earlier determinant formulas for the probability that C_alpha is thinner than a given partition, the paper derives exact factorial moments for the number |I_d| of clusters of a fixed finite size d (Prop. 3), an asymptotic evaluation of the relevant cumulants (Lemma 2), and a claimed limit theorem: |I_d| converges in distribution to a mixed Poisson law with mixing variable H_alpha = exp(-d Z_alpha / kappa), where Z_alpha is Gamma(alpha,1) (Prop. 5). The paper also proves that, for any epsilon>0, clusters of size larger than n^{1-epsilon} exist with probability tending to 1 (Prop. 6), and discusses the relation to the Erdos-Renyi tree census.","tokens_in":5413,"tokens_out":12076,"duration_ms":102357,"significance":"The paper's approach is elegant and uses powerful, well-established tools: Green-function determinants, moment/cumulant relations, and the author's prior loop-cluster formalism. The exact factorial moment formula in Prop. 3 and the sharp asymptotics of the cumulants in Lemma 2 are valuable and appear correct. If the distributional result were established, it would give a complete explicit small-cluster census for loop clusters on complete graphs, complementing classical random graph results. The paper is concise and mostly rigorous, with explicit determinant and moment computations. However, as detailed below, the central limit statement contains a factor error that must be corrected.","major_comments":[{"comment":"Proposition 5 is inconsistent with the factorial moments derived in Proposition 3 and Lemma 2. From Proposition 3 and Lemma 2, E[|I_d|(|I_d|-1)...(|I_d|-k+1)] converges to (alpha/d)^k (kappa/(kd+kappa))^alpha. The mixed Poisson law with mixing variable H_alpha = exp(-d Z_alpha / kappa) has factorial moments E[H_alpha^k] = (kappa/(kd+kappa))^alpha. The two sequences differ by a factor (alpha/d)^k for every k>=1 and every d>=2, and by alpha^k for d=1. For instance, for d=2 and alpha=1, the derived first factorial moment tends to (1/2) kappa/(kappa+2), whereas the claimed limit has mean kappa/(kappa+2). Hence Proposition 5 does not follow from the preceding asymptotics. The mixing variable should presumably be H_alpha = (alpha/d) exp(-d Z_alpha / kappa), and the displayed alpha=1 density must be modified accordingly.","section":"§4, Proposition 6"},{"comment":"The Markov bound in the proof of Proposition 6 is typeset as n^epsilon/epsilon, which is greater than 1 for large n; with this bound the claimed lower bound (1 - n^{-alpha epsilon/2})(1 - n^epsilon/epsilon) is negative and cannot tend to 1. The intended estimate must be of order n^{-epsilon}/epsilon (or 1/(epsilon n^epsilon)); with that correction the argument appears to work. This is a localized but necessary correction.","section":"§4, Proposition 6"},{"comment":"The passage from convergence of factorial moments to convergence in distribution is not justified. Even after correcting the mixing variable, the paper should either cite a standard moment-convergence theorem for nonnegative integer-valued random variables whose factorial moments converge to those of a mixed Poisson law with bounded mixing variable, or provide a short proof. As written, the distributional conclusion in Proposition 5 is an assertion rather than a consequence of the moment computations.","section":"§3, Proposition 5"}],"minor_comments":[{"comment":"The word 'emsembles' should be 'ensembles'.","section":"Abstract"},{"comment":"The word 'demoting' should be 'denoting'.","section":"§4, proof of Proposition 6"},{"comment":"The reference to 'lemma 3' should be to 'Lemma 2'.","section":"§3, note after Lemma 2"},{"comment":"The notation c_d^alpha is not defined at first use; it refers to the d-th cumulant of Y^(alpha) defined before formula (4), but the superscript should be made consistent (for example, c_d^(alpha)).","section":"§3, Proposition 3"},{"comment":"The displayed formula for the alpha=1 case appears to be missing an equality sign and, once the factor error in the mixing variable is fixed, needs to be recomputed; the current display does not follow from the stated mixing variable.","section":"§3, Proposition 5"},{"comment":"The sentence about expansions in powers of x = 1/(n+1) and the triangle A087903 would benefit from a brief explanation or reference.","section":"Remark 3.2"}],"recommendation":"major_revision","confidential_remarks":"The main result (Prop. 5) contains a genuine algebraic error that reverses a key prefactor; however, the correct statement is an obvious modification of the stated one, so the paper is salvageable. The author should also correct the Markov bound in Prop. 6 and add a justification for the moment-to-distribution step. I recommend major revision rather than rejection, and I would be willing to re-review a corrected version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper does a clean job of specializing the loop cluster framework to complete graphs, but the headline limit theorem (Prop 5) is wrong for d≥2. The stress-test note is correct. From Prop 3 and Lemma 2, the k-th factorial moment of |I_d| converges to (α/d)^k (κ/(kd+κ))^α. The mixed Poisson law stated in Prop 5 uses H_α = exp(-dZ_α/κ), whose factorial moments are (κ/(kd+κ))^α. So for d≥2 the claimed distribution has the wrong moments. The fix is local: replace H_α by (α/d)H_α, or equivalently state the limit as a mixed Poisson with that mixing variable. For d=1, Lemma 2's asymptotic c_d ∼ α(d-1)!n^{-d} fails (the first cumulant tends to 1, not α/n), so the isolated-vertex result in Prop 4 is fine, but the paper should say Lemma 2 is for d≥2.\n\nWhat is good: the derivation of Prop 3 via Green determinants and the factorization of loop sets is elegant; the reduction of connectivity to isolated d-gons in Lemma 2's proof is a nice argument; Prop 6 gives a simple existence proof for large clusters, modulo a trivial typo (n^ε/ε should be n^{-ε}/ε or 1/ε). The self-citation is legitimate—Prop 1 and 2 are the author's own framework, and the new results are derived from them rather than assumed.\n\nSoft spots: the missing factor is load-bearing because Prop 5 is the main advertised result. The step from factorial moment convergence to distributional convergence is also not justified; given the moments grow like (α/d)^k, you need a bit more than \"consequently.\" That said, the method is sound and the correction is contained. The d=1 exception should be stated explicitly.\n\nWho this is for: people working on Markov loop soups and random partitions on dense graphs. They will find Prop 3 and Lemma 2 useful as a reference model, but they should not quote Prop 5 as is.\n\nRecommendation: send it to a referee, but with a note that the central limit statement needs to be corrected. If the author fixes the mixing variable and cleans up the moment-to-distribution step, this becomes a solid short paper.","headline":"A useful short paper on loop cluster asymptotics for complete graphs, but Proposition 5 is missing a factor (α/d)^k for d≥2 and needs a local correction.","tokens_in":5934,"tokens_out":7138,"would_cite":true,"duration_ms":60555,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60C05","60J27","60G60"],"pacs":[],"model":"deepseek-v4-flash","headline":"The number of fixed-size loop clusters on a large complete graph converges to a mixed Poisson law with an explicit Gamma-driven mixing variable.","keywords":["Markov loops","loop clusters","complete graph","mixed Poisson distribution","Gamma distribution","cumulants","random partitions","large clusters"],"falsifier":"Check the arithmetic connecting Propositions 3 and 5: Proposition 3 gives $\\lim_n \\mathbb{E}[(|I_d|)_k] = \\alpha^k d^{-k}(\\kappa/(kd+\\kappa))^\\alpha$, whereas the mixed-Poisson law in Proposition 5 has factorial moments $\\mathbb{E}[H_\\alpha^k]=(\\kappa/(kd+\\kappa))^\\alpha$; for $d\\ge 2$ these differ by $d^{-k}$, so a direct verification of which formula matches a simulation of $K_n$ for large $n$ would settle the exact limiting statement.","tokens_in":4926,"feed_emoji":"🔗","tokens_out":19725,"duration_ms":180895,"temperature":0.7,"pith_summary":"This paper studies the random partition of the complete graph $K_n$ generated by a Poissonian ensemble of Markov loops with intensity parameter $\\alpha$, unit conductances, and constant killing $\\kappa$. It seeks the asymptotic census of small clusters: for each fixed cluster size $d\\ge 2$, the number $|I_d|$ of clusters occupying exactly $d$ vertices converges in distribution to a mixed Poisson law, with the mixing variable an explicit function $H_\\alpha=\\exp(-dZ_\\alpha/\\kappa)$ of a Gamma$(\\alpha,1)$ variable; for $\\alpha=1$ this gives a closed-form integral density. The same analysis shows the proportion of isolated vertices converges to $R_\\alpha=\\exp(-Z_\\alpha/\\kappa)$, and that with probability tending to 1 the partition contains clusters visiting more than $n^{1-\\epsilon}$ vertices. The result gives a complete asymptotic description of the small-cluster side of the loop-cluster partition on the complete graph, and it identifies the dominant mechanism: asymptotically, a fixed-size cluster is created by a single $d$-gon loop rather than by an accumulation of smaller loops.","feed_headline":"Loop-cluster counts on complete graphs hit a mixed Poisson limit","feed_subtitle":"The limiting count of d-vertex clusters is a Poisson mixture; when α=1, the density is explicit.","key_machinery":"The engine is the Green-matrix determinant formula for loop clusters: for any partition $\\pi$, $P(C_\\alpha \\succeq \\pi)=(\\prod_i \\det G_{B_i}/\\det G)^\\alpha$. On the complete graph this becomes a product of moments of $Y^{(\\alpha)}=\\exp(Z_\\alpha/(n+\\kappa))$, because the determinant of the Green matrix on a $d$-set is $1/((n-d+\\kappa)(n+\\kappa)^{d-1})$. The cluster probabilities are then rewritten using cumulants $c_d^{(\\alpha)}$, whose asymptotic $\\alpha(d-1)!\\,n^{-d}$ is obtained in Lemma 2 by sandwiching the connectedness probability of an isolated $d$-set: below by the probability that exactly one $d$-gon appears, above by that event plus bounds on loops of total size exceeding $d$. This single-$d$-gon dominance mechanism converts the exact but unwieldy inclusion-exclusion formula into a Poisson-mixture limit.","core_discovery":"The central discovery is an exact asymptotic law for the small-cluster census. For fixed $\\alpha>0$ and fixed $d\\ge 2$, let $I_d$ be the set of $C_\\alpha$-clusters of cardinality $d$ in $K_n$ with unit conductances and killing $\\kappa$. Proposition 5 asserts that as $n\\to\\infty$, $|I_d|$ converges in distribution to a mixture of Poisson distributions: $P(|I_d|=k)\\to \\mathbb{E}[H_\\alpha^k e^{-H_\\alpha}/k!]$, where $H_\\alpha=\\exp(-dZ_\\alpha/\\kappa)$ and $Z_\\alpha$ is Gamma$(\\alpha,1)$. In the case $\\alpha=1$, this becomes $\\int_0^1 \\frac{x^k}{k!}e^{-x}\\frac{\\kappa}{d}x^{\\kappa/d-1}\\,dx$. The proof establishes that the asymptotic factorial moments are $\\alpha^k d^{-k}(\\kappa/(kd+\\kappa))^\\alpha$, and shows that the probability an isolated $d$-set is connected is asymptotically equal to the probability that it contains exactly one $d$-gon loop and no other loops. Alongside this, Proposition 6 shows that for every $\\epsilon>0$, clusters of size larger than $n^{1-\\epsilon}$ exist with probability tending to 1; whether clusters of linear size $cn$ exist is left open.","pith_inferences":["The same determinant-cumulant route should apply to other dense graph families with high symmetry; the mixing variable would still be Gamma-driven, with the killing parameter replaced by an effective spectral parameter.","The 'one cycle dominates' lemma suggests a general principle for loop soups on graphs of bounded local cycle density: the leading contribution to a small cluster is a single simple cycle, which could be tested numerically on tori or sparse random graphs.","The open question of linear-size clusters could be approached by refining Proposition 6's second-moment calculation: if the visited-set size of the longest loop concentrates near its length, the existence of $cn$-clusters would follow for small $c$; conversely, a superpolylogarithmic upper tail would rule them out."],"forward_implications":["For fixed $\\kappa$ and $\\alpha$, all factorial moments of $|I_d|$ have explicit limits, so moment methods determine the full limiting distribution without further inclusion-exclusion.","For $\\alpha=1$, the limiting distribution has a one-line integral formula, allowing direct computation of quantities such as the probability of seeing no clusters of size $d$.","Asymptotically, a fixed-size cluster is caused by a single $d$-cycle; larger loop configurations contribute only lower-order corrections.","With probability tending to 1, the loop-cluster partition has macroscopic clusters spanning more than $n^{1-\\epsilon}$ vertices for every $\\epsilon>0$, while clusters of linear size remain an open question."],"supporting_citations":[{"why":"Supplies the determinant formula for the probability that the loop partition is thinner than a given partition, the starting point for all cluster probabilities.","marker":"[4]"},{"why":"Provides the Poissonian loop-measure construction, the independence structure of loops, and the Green-matrix identity used to bound large loop configurations in Lemma 2.","marker":"[6]"},{"why":"Supplies the loop-measure framework and formula 6-4, also used in the upper bound of Lemma 2.","marker":"[5]"},{"why":"Gives the cumulant-moment relations used to express the one-block probability as a ratio of cumulant to moment.","marker":"[2]"},{"why":"Also gives the cumulant-moment formula (1.30) used in deriving formula (4).","marker":"[7]"},{"why":"Provides the limit distribution of loop lengths under the normalized loop measure, used to prove existence of large clusters in Proposition 6.","marker":"[1]"}],"fun_headline_variants":["Mixed Poisson limit for loop-cluster counts on complete graphs","Exact limit law for small loop clusters in complete graphs","Complete-graph loop clusters: counts converge to Poisson mixture","Loop-cluster census on complete graphs: mixed Poisson asymptotics","d-cluster counts in loop ensembles follow explicit Poisson mixture"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything rests on treating the loops inside each candidate cluster as independent of the loops touching the remaining vertices and on the complete graph's self-similarity under replacing a $d$-set by a full graph with killing $n-d+\\kappa$; if that step is not valid, the factored product of cluster probabilities behind Proposition 5 collapses.","fun_headline_variants_meta":{"raw":{"variants":["Mixed Poisson limit for loop-cluster counts on complete graphs","Exact limit law for small loop clusters in complete graphs","Complete-graph loop clusters: counts converge to Poisson mixture","Loop-cluster census on complete graphs: mixed Poisson asymptotics","d-cluster counts in loop ensembles follow explicit Poisson mixture"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00056,"raw_usage":{"total_tokens":2599,"prompt_tokens":823,"completion_tokens":1776,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":439,"completion_tokens_details":{"reasoning_tokens":1694}},"tokens_in":439,"tokens_out":1776,"duration_ms":11025,"temperature":1.0,"reasoning_tokens":1694,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T10:53:04.642199+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Check the arithmetic connecting Propositions 3 and 5: Proposition 3 gives $\\lim_n \\mathbb{E}[(|I_d|)_k] = \\alpha^k d^{-k}(\\kappa/(kd+\\kappa))^\\alpha$, whereas the mixed-Poisson law in Proposition 5 has factorial moments $\\mathbb{E}[H_\\alpha^k]=(\\kappa/(kd+\\kappa))^\\alpha$; for $d\\ge 2$ these differ by $d^{-k}$, so a direct verification of which formula matches a simulation of $K_n$ for large $n$ would settle the exact limiting statement.","supporting_citations":[{"cited_title":"Loop cluster on the discrete circle","cited_arxiv_id":"1311.7583","evidence_quote":"Supplies the determinant formula for the probability that the loop partition is thinner than a given partition, the starting point for all cluster probabilities."},{"cited_title":"A convergence result on the lengths of Markovian loops","cited_arxiv_id":null,"evidence_quote":"Provides the Poissonian loop-measure construction, the independence structure of loops, and the Green-matrix identity used to bound large loop configurations in Lemma 2."},{"cited_title":"Jacobian Tori Associated with a Finite Graph and Its Abelian Covering Graphs","cited_arxiv_id":null,"evidence_quote":"Supplies the loop-measure framework and formula 6-4, also used in the upper bound of Lemma 2."},{"cited_title":"Non-backtracking loop soups and statistical mechanics on spin networks","cited_arxiv_id":null,"evidence_quote":"Gives the cumulant-moment relations used to express the one-block probability as a ratio of cumulant to moment."},{"cited_title":"The Brownian loop soup","cited_arxiv_id":null,"evidence_quote":"Also gives the cumulant-moment formula (1.30) used in deriving formula (4)."},{"cited_title":"Graphs and digraphs","cited_arxiv_id":null,"evidence_quote":"Provides the limit distribution of loop lengths under the normalized loop measure, used to prove existence of large clusters in Proposition 6."}],"review_version":1}