{"id":"d71fa4b7-b55c-4eff-94f6-09e910cf34c0","arxiv_id":"2608.08679","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"If all edge-rooted densities of any finite graph are constant in a graphon, the graphon is constant unless the total density is zero.","lead":"This paper proves that if every edge-rooted density of a finite graph pattern inside a graph limit is constant, then the graph limit must be either empty or perfectly uniform. This answers a question about which graph patterns force a large graph to be quasirandom, meaning evenly spread and structureless.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the central theorem and its clique-forcing corollary hold up under scrutiny; the only cited-not-proved step (weighted counting lemma) is standard.","rationale":"I examined the main theorem and its proof carefully. The entropy argument in Proposition 2.1 is sound: constant rooted densities imply uniform edge marginals under the Gibbs measure, the relative entropy and Jensen inequalities force equality, and strict convexity of exp gives the additive identity for log W. Proposition 2.2's Hoeffding variance calculation is correct for symmetric kernels, and together these prove Theorem 1.1 without hidden assumptions. The reader's weakest assumption concerned continuity of rooted densities in cut norm, which is the one step in Corollary 3.1 that is cited rather than proved. I checked this step: the integral over A x B of the rooted density is a weighted homomorphism density with vertex weights bounded by 1, and the standard telescoping/counting lemma proof extends directly, so the step is legitimate. The hypergraphon and directed results are proven within explicitly stated models, and the paper honestly notes the scope limits of those models. No circularity, missing proof, or internal inconsistency emerged. Therefore I see no reason to change the ACCEPT verdict, though the cited counting lemma could be spelled out in more detail for full self-containment.","tokens_in":19130,"tokens_out":32564,"duration_ms":356031,"concrete_test":"Re-derive the weighted counting lemma bound |integral_{A x B} (r_e^U - r_e^V)| <= |E(K_k)| d_square(U,V) for arbitrary measurable A,B by telescoping over the edges of K_k and applying the cut-norm inequality term-by-term with the vertex weights 1_A and 1_B; if the telescoping requires an unstated factorization condition, the clique-forcing corollary would need a revised continuity argument.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No load-bearing concern identified. Theorem 1.1's proof is self-contained given the standard Hoeffding decomposition and the entropy/Jensen equality argument; the positivity step W >= t(F,W) from constant rooted densities is valid. The only external step is the weighted counting lemma used in Corollary 3.1 to pass from the finite two-set condition to the limiting rooted identity r_e^W = p^m. This is a standard extension of Lovasz Theorem 10.23 with vertex weights 1_A and 1_B bounded by 1, and the paper sketches the telescoping argument. Thus the continuity step flagged by the reader is not a real gap. Scope limitations for hypergraphons and directed kernels are stated explicitly and do not affect the central graphon claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies rooted subgraph-density rigidity for graphons. Theorem 1.1 states that if every edge-rooted F-density of a graphon W is constant, then either t(F,W)=0 or W is constant equal to t(F,W)^{1/m}. The proof combines two reductions: a relative-entropy argument showing that the sum of log W over the edges of F is almost surely constant, and a Hoeffding/ANOVA variance computation showing that such a constant sum forces log W to be constant. Section 3 derives the clique-forcing corollary (every clique is 2-forcing), answering a question of Reiher and Schacht, and gives a quantitative stability estimate. Section 4 extends the result to symmetric uniform hyperkernels and to dissociated Aldous-Hoover hypergraphons, with stability estimates. Section 5 classifies the directed analogue: non-Eulerian templates force W to be constant, while Eulerian templates allow the family W(x,y)=p exp(phi(x)-phi(y)); imposing the tournamenton identity collapses this family to W=1/2. Explicit stability estimates are given for non-Eulerian directed templates and for regular tournaments.","tokens_in":19242,"tokens_out":39382,"duration_ms":388214,"significance":"If correct, the main theorem is a substantial and elegant generalization of the edge-rooted triangle theorem of Reiher and Schacht. The proof is fully written, self-contained apart from standard tools, and yields explicit quantitative bounds. The clique-forcing answer settles a question in the literature. The method, relative-entropy equality combined with Hoeffding variance, is likely to be reusable in related rigidity problems. The hypergraphon and directed results are model-dependent, but the paper is transparent about these limitations. There are no fitted parameters and the predictions are concrete. Overall this is a strong contribution to the quasirandomness and graph-limits literature.","major_comments":[],"minor_comments":[{"comment":"In Eq. (5.8), the factor '2emM' appears to be a typo for '2e^{mM}'; every other use of Lemma 2.3 in Theorems 3.2, 4.3, 4.5, and 5.2 has the exponential e^{mM}. Please correct this.","section":"Corollary 5.5"},{"comment":"The phrase 'ANOV A decomposition' should read 'ANOVA decomposition'; the spacing is a typo.","section":"Section 2"},{"comment":"The transfer from the finite two-set condition to the pointwise identity r_e^W = p^m rests on the weighted counting lemma [21, Theorem 10.23]. The step is standard and the paper sketches it, but a one-sentence reminder of why the telescoping proof applies with the two vertex weights 1_A and 1_B bounded by 1 would make this load-bearing passage more self-contained.","section":"Corollary 3.1"},{"comment":"The hypergraphon classification is stated for the dissociated Aldous-Hoover representation, and the directed classification for the one-function kernel model; the paper is explicit about this, but it may be worth repeating in the conclusion that these classifications do not automatically transfer to general digraphon or hypergraphon frameworks with a global mixing coordinate.","section":"Sections 4 and 5"}],"recommendation":"minor_revision","confidential_remarks":"I found no basis for rejection. The main theorem and its proof are sound; the issues are typographical and presentational. The paper is a good fit for the journal. The only equation-level typo I noticed is in Corollary 5.5. I recommend minor revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper is a strong, self-contained contribution to the graph-limits side of quasirandomness. The main result — if every edge-rooted F-density in a graphon is constant, then either the F-density is zero or the graphon is constant — is proved by a genuinely clean two-step method: constant rooted densities make the Gibbs edge marginals uniform, and equality in Jensen plus strict convexity gives a constant sum of log-weights; the Hoeffding decomposition then rules out nonconstant symmetric kernels. The same argument answers the Reiher-Schacht question (every clique is 2-forcing) and extends, with explicit stability estimates, to uniform hyperkernels, the dissociated Aldous-Hoover hypergraphon model, directed kernels, and tournamentons. The directed classification is interesting in its own right: the only nonconstant positive-density solutions come from Eulerian templates and have the form p exp(phi(x)-phi(y)).\n\nI checked the main line of proof and it holds up. The entropy step and the variance computation are correct. The stability estimates are explicit and the constants are honest. The zero-density alternative is handled carefully. The citations look appropriate, and related work on hereditary quasirandomness, forcing pairs, and tournament limits is discussed rather than ignored.\n\nSoft spots, in proportion: the most intricate part is Lemma 4.4 for full hypergraphons. I believe the orthogonality/cancellation argument is correct, but it is the kind of thing a referee should verify slowly. The transfer in Corollary 3.1 from the finite two-set condition to the limiting rooted identity uses the weighted counting lemma as a black box. This is standard (Lovasz 10.23, or a telescoping proof), and the paper sketches the reduction, so I do not regard it as a gap. The directed kernel model is explicitly one-function, so the Eulerian family may not survive in a more general digraphon framework; the paper is upfront about that. The stability constants are not optimized; the paper says so.\n\nWho it is for: anyone working on quasirandomness, graph limits, or forcing. It also gives a usable template for other rooted-density problems. I would bring it to a reading group and likely cite it.\n\nRecommendation: send it to a serious referee. The referee should focus on Section 4 and the quantitative tournamenton estimate. I expect acceptance after that pass.","headline":"A clean, correct proof of all-edge rooted forcing, with a solid resolution of the Reiher-Schacht clique question and a unified entropy+Hoeffding method that extends well beyond the graphon case.","tokens_in":19759,"tokens_out":12431,"would_cite":true,"duration_ms":121748,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C80","05C20","05C35","05C60","05C65","60G09"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that a graphon whose edge-rooted densities for every edge of a fixed graph are constant must either have zero density or be constant itself, and derives the consequence that every clique is 2-forcing.","keywords":["graphons","rooted subgraph densities","quasirandomness","ANOVA decomposition","entropy method","hypergraphons","tournamentons","clique forcing"],"falsifier":"Run a finite search over two-part step graphons for a fixed graph F: if any nonconstant symmetric 2x2 matrix W with entries in [0,1] and t(F,W)>0 has all edge-rooted densities exactly equal to the same constant, Theorem 1.1 is false. The rooted densities are polynomials in the matrix entries, so the search is a finite system of polynomial equations. A directed falsifier would be a non-Eulerian oriented graph D and a nonconstant directed kernel with t(D,W)>0 and all arc-rooted densities constant, which the paper's Theorem 1.3 rules out.","tokens_in":18926,"feed_emoji":"📊","tokens_out":10105,"duration_ms":105734,"temperature":0.7,"pith_summary":"This paper proves a strong rigidity statement for dense graph limits. If, for every edge e of some fixed graph F, the density of F in a graphon W rooted at e is constant almost everywhere, then either the total F-density is zero or W itself is constant, with constant value p = t(F,W)^{1/m}. The proof's two-step mechanism—an entropy (relative-entropy) argument converts constant rooted densities into an additive identity for log W over the edges of F, and an orthogonal ANOVA variance decomposition shows that only a constant function can satisfy it—extends to hyperkernels, dissociated hypergraphons, directed kernels, and tournamentons, including explicit stability estimates when W is bounded away from zero. As a corollary, every clique is 2-forcing, which determines the exact minimum number of vertex sets needed in the forcing question from the edge-rooted triangle literature.","feed_headline":"Constant edge-rooted densities force graphons to be constant","feed_subtitle":"A two-step entropy-and-variance proof settles the clique-forcing question and extends to tournaments and hypergraphs.","key_machinery":"The load-bearing object is the edge-rooted density r^W_e, obtained from the homomorphism density t(F,W) by fixing the two vertex variables of an edge and integrating out all other vertices. The proof has two reductions. First, the probability measure on vertex assignments proportional to the product of edge weights has uniform edge marginals exactly when rooted densities are constant; relative entropy and the convexity of the exponential then force the sum of log W over the edges of F to be constant almost everywhere. Second, the orthogonal ANOVA decomposition writes a symmetric L2 function as a sum of components depending on exactly 0, 1, or 2 coordinates; computing the variance of that edge sum shows that a constant sum is possible only when all nonconstant components vanish. The directed case uses the nonsymmetric version of the same decomposition, whose one-coordinate terms leave the gauge freedom $\\varphi$(x)-$\\varphi$(y), and the hypergraph case applies the decomposition to local coordinates attached to proper subsets of an edge.","core_discovery":"The central discovery is a dichotomy for edge-rooted densities: for any finite graph F with m>0 edges and any graphon W, if every edge-rooted density r^W_e is constant almost everywhere, then either t(F,W)=0 or W=p almost everywhere with p=t(F,W)^{1/m}. The paper proves the same dichotomy in three further settings: symmetric k-uniform hyperkernels and dissociated hypergraphons (where the rooted variables include all coordinates attached to nonempty proper subsets of an edge), one-function directed kernels (where non-Eulerian oriented templates force W constant and Eulerian templates allow the gauge family W(x,y)=p exp($\\varphi$(x)-$\\varphi$(y))), and tournamentons, where the antisymmetry W(x,y)+W(y,x)=1 collapses the gauge family to the uniform kernel W=1/2. Quantitative versions replace exact constancy by a bound on the total L1 marginal error and give explicit L1 and L2 bounds on W-p; in the exact positive-density case the equations themselves imply the lower bound W>=t(F,W), so no separate boundedness assumption is needed.","pith_inferences":["Because the argument uses only convexity and orthogonality, the same dichotomy should hold for weighted graphons and for kernels taking values in any bounded interval; a direct check on weighted step graphons would be a cheap extension.","The Eulerian gauge family suggests that in a two-function digraphon model, where opposite arcs are governed by independent kernels, constant arc-rooted densities may admit a wider family of solutions; the one-function model used here is the symmetric case, so the classification is not automatically the general digraphon classification.","The hypergraph remark implies a practical warning: any quasirandomness test for k-uniform hypergraphs that roots only vertex coordinates can be fooled by additive pair-coordinate perturbations, so tests should use full-edge-rooted densities.","The total marginal error Delta is a graphon functional that can be estimated from a single large graph by sampling; the stability estimate then yields a computable bound on the distance to p-quasirandomness, which is a testable algorithmic consequence."],"forward_implications":["Every clique K_k is 2-forcing; for k>=4 the minimum number of vertex subsets in the forcing condition is exactly 2, improving the earlier upper bound ceil((k+1)/2).","At positive density, constant rooted densities imply the pointwise lower bound W >= t(F,W), so the classification needs no extra hypotheses beyond the rooted equations.","For non-Eulerian oriented graphs, constant arc-rooted densities force the directed kernel to be constant; for Eulerian templates the only solutions are the gauge kernels p exp(phi(x)-phi(y)), and the tournamenton identity forces p=1/2 and phi constant.","In the hypergraph models, rooting only vertex variables is provably insufficient; rigidity holds only when all coordinates attached to proper subsets of the edge are fixed.","The stability estimates give an explicit quantitative certificate: a small total marginal error Delta_F(W) forces W to be close in L1 and L2 to the constant graphon p."],"supporting_citations":[{"why":"Supplies the orthogonal ANOVA decomposition of functions on product spaces that the variance step uses in every setting.","marker":"[15]"},{"why":"Supplies the weighted counting lemma used to pass the finite supremum condition of 2-forcing to the pointwise rooted-density equation in the limit graphon.","marker":"[21]"},{"why":"Provides the edge-rooted triangle theorem that Theorem 1.1 recovers and the clique-forcing question that Corollary 3.1 answers.","marker":"[26]"},{"why":"Gives the tournamenton triangle-coregularity condition that the paper compares with its arc-rooted-density condition in Section 5.","marker":"[6]"},{"why":"Provides the representation theory of exchangeable arrays underlying the dissociated hypergraphon coordinate model used in Theorem 1.2(ii).","marker":"[18]"},{"why":"Supplies the earlier upper bound ceil((k+1)/2) for clique forcing, which Corollary 3.1 improves to exactly 2.","marker":"[16]"}],"fun_headline_variants":["Constant edge-rooted densities force graphons to zero or constant","A dichotomy: constant rooted densities imply zero or uniform graphon","Rooted densities: constancy forces zero or constant graphon","Zero or constant: the only outcome of edge-rooted density constancy"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing assumption is that a tiny error over all pairs of vertex subsets in a finite graph implies a tiny error in the edge-rooted density of the limiting graphon; if that continuity failed, the combinatorial 2-forcing condition would not imply the pointwise constancy that the main theorem solves.","fun_headline_variants_meta":{"raw":{"variants":["Constant edge-rooted densities force graphons to zero or constant","A dichotomy: constant rooted densities imply zero or uniform graphon","Rooted densities: constancy forces zero or constant graphon","Zero or constant: the only outcome of edge-rooted density constancy"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001365,"raw_usage":{"total_tokens":5535,"prompt_tokens":941,"completion_tokens":4594,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":557,"completion_tokens_details":{"reasoning_tokens":4521}},"tokens_in":557,"tokens_out":4594,"duration_ms":38302,"temperature":1.0,"reasoning_tokens":4521,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T04:29:45.304770+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run a finite search over two-part step graphons for a fixed graph F: if any nonconstant symmetric 2x2 matrix W with entries in [0,1] and t(F,W)>0 has all edge-rooted densities exactly equal to the same constant, Theorem 1.1 is false. The rooted densities are polynomials in the matrix entries, so the search is a finite system of polynomial equations. A directed falsifier would be a non-Eulerian oriented graph D and a nonconstant directed kernel with t(D,W)>0 and all arc-rooted densities constant, which the paper's Theorem 1.3 rules out.","supporting_citations":[{"cited_title":"Hoeffding","cited_arxiv_id":null,"evidence_quote":"Supplies the orthogonal ANOVA decomposition of functions on product spaces that the variance step uses in every setting."},{"cited_title":"Lov´ asz.Large Networks and Graph Limits, volume 60 ofAmerican Mathematical Society Colloquium Publications","cited_arxiv_id":null,"evidence_quote":"Supplies the weighted counting lemma used to pass the finite supremum condition of 2-forcing to the pointwise rooted-density equation in the limit graphon."},{"cited_title":"Reiher and M","cited_arxiv_id":null,"evidence_quote":"Provides the edge-rooted triangle theorem that Theorem 1.1 recovers and the clique-forcing question that Corollary 3.1 answers."},{"cited_title":"Transitivity in Inhomogeneous Random Tournaments","cited_arxiv_id":"2606.02340","evidence_quote":"Gives the tournamenton triangle-coregularity condition that the paper compares with its arc-rooted-density condition in Section 5."},{"cited_title":"Kallenberg.Probabilistic Symmetries and Invariance Principles","cited_arxiv_id":null,"evidence_quote":"Provides the representation theory of exchangeable arrays underlying the dissociated hypergraphon coordinate model used in Theorem 1.2(ii)."},{"cited_title":"Hubai, D","cited_arxiv_id":null,"evidence_quote":"Supplies the earlier upper bound ceil((k+1)/2) for clique forcing, which Corollary 3.1 improves to exactly 2."}],"review_version":1}