{"id":"de95e968-2b69-4cb7-abbe-b32d692ab638","arxiv_id":"1908.08565","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Vertex-weighted exponential random graphs with clique-counting Hamiltonians are 1-norm close to mixtures of stochastic block models with a few communities.","lead":"Vertex-weighted exponential random graphs, where an edge between two vertices depends on the product of their weights, are shown to be close to mixtures of graph models whose weight vector is near a fixed point, and that fixed-point set reduces to a few communities. The result gives a dimension reduction principle for dependent-edge network models, and includes a detailed analysis of the triangle-counting case.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Triangle-case conclusion rests on an unproved two-block symmetric ansatz; non-symmetric or multi-block fixed points could invalidate the claim that all solutions tend to zero.","rationale":"The reader correctly identified the two-block ansatz as the weakest assumption. The central existence theorems (4.1, 4.4, 4.7, 4.9) are structurally sound and follow the Eldan-Gross framework with plausible bounds; Corollary 4.5 gives the main dimension-reduction statement. The triangle section, however, contains a logical gap between an assumed solution shape and an unconditional uniqueness claim. I see no internal inconsistency in the earlier theorems, and the positive/small-weight results are conditional in their statements even though the abstract overstates them slightly. The proposed numerical test would directly probe whether non-constant fixed points exist in the triangle model; if none exist for moderate n and large α, it would lend support to the conclusion despite the proof gap. Thus the paper remains a conditional accept, in agreement with the reader's verdict.","tokens_in":19897,"tokens_out":40969,"duration_ms":366789,"concrete_test":"Numerically search for all fixed points of the triangle fixed-point equation. For p=1/2 and the sign/absorption convention of (5.3)-(5.4), take n ∈ {12, 20, 30} and α ∈ {10, 50, 100, 500}. Initialize a fixed-point solver for X = Φ(X) := (1n + tanh(∇f(X)))/2 (using the continuous extrapolation of the triangle gradient) from: (i) random vectors in [0,1]^n, (ii) constant vectors c1n for c on a fine grid, (iii) two-block vectors with block sizes θn and (1-θ)n for θ ∈ {1/4,1/3,1/2,2/3,3/4} and (a,b) on a 50x50 grid, and (iv) three-block vectors with random sizes and values. For each converged X, check whether ||X - x1n||_1 > 0.1n, where x solves 1-2x = tanh(αx^2/2). If any such non-constant fixed point is found, the triangle claim is false; if all found fixed points are within o(n) of the constant vector, the concern is mitigated but not formally closed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The weakest link is Section 5's two-block ansatz. The paper assumes a solution to the fixed-point equation (5.2) of the form X = (a,...,a,b,...,b) with n/2 entries of each, derives equations (5.3)-(5.4), and then concludes that 'for n large enough, the only solution to this system is given by the constant solution a=b.' This conclusion is only about solutions within the assumed ansatz; the paper does not prove that every solution to (5.2) has this form. The model is exchangeable, so symmetry does not force a two-block equal-size structure; it only means the solution set is permutation-invariant. Non-symmetric two-block solutions with θn and (1-θ)n blocks, solutions with more than two blocks, or non-block vectors are not analyzed. Since Theorem 4.4 only guarantees closeness to some block vector with Cδ communities (which may be huge and depends on δ), it cannot be used to reduce the triangle analysis to the two-block case. Therefore the abstract's claim that the solution approaches the zero vector as the triangle weight diverges to -∞ is not established. This is load-bearing because the triangle case is the main concrete demonstration of collapse to a single constant vector, and the unweighted edge-triangle model has non-constant two-community solutions.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies vertex-weighted exponential random graph models on n vertices, where the Hamiltonian is a weighted sum of normalized products of vertex weights (clique counts) plus a log-odds term that absorbs the Bernoulli distribution of the vertex weights. Using the Eldan-Gross decomposition as a black box, the authors bound the gradient complexity and Lipschitz constants of such Hamiltonians and derive a mixture approximation whose support lies on near fixed points of the vector equation X=(1+tanh(∇f(X)))/2. They then prove that near fixed points are close to block vectors with a number of communities independent of n (Theorem 4.4, Corollary 4.5), that for nonnegative weights satisfying a contraction condition the near fixed points are close to a unique constant vector (Theorem 4.7), and that for sufficiently small weights in either direction the fixed-point map is a contraction with an explicit n^{7/8} error (Theorem 4.9). The last section analyzes the triangle-only Hamiltonian under a two-block symmetric ansatz and claims that for large n the only solution is the constant vector, which approaches zero as the triangle weight diverges.","tokens_in":20191,"tokens_out":24715,"duration_ms":243700,"significance":"If the main structural results are correct, this is a useful vertex-weighted analogue of the Eldan-Gross and Chatterjee-Diaconis theory, with the added benefit of working in the finer 1-norm and covering sparse regimes such as Example 4.8. The paper's strengths include explicit, parameter-independent bounds on D(f), L1, and L2 in Section 3, a clean adaptation of the Johnson-Lindenstrauss block approximation in Theorem 4.4, and parameter-explicit error rates in Theorems 4.7 and 4.9 with no fitted constants. The triangle section is the main weakness: its headline conclusion is not supported as stated, because the two-block ansatz is assumed rather than derived, and the passage to the n→∞ limit does not establish uniqueness for finite large n.","major_comments":[{"comment":"The paper assumes a solution of the fixed-point equation X=(1+tanh(∇f(X)))/2 of the form (a,...,a,b,...,b) with exactly n/2 entries of each type, and all subsequent claims about the triangle case—including the statement that for large n only the constant solution exists—are confined to this ansatz. No proof is given that every solution, or every relevant near-fixed point produced by Theorem 4.1, has this form. The model is exchangeable, so the solution set is permutation-invariant, but permutation invariance does not force equal-size two-block structure; non-symmetric two-block solutions with unequal block sizes, multi-block solutions, and non-block vectors are not analyzed. Theorem 4.4 only asserts closeness to some block vector whose number of communities may be large and depends on δ, so it cannot justify the two-block reduction. This gap is load-bearing because the abstract's claim that the solution approaches the zero vector as the triangle weight diverges to -∞ rests entirely on this ansatz.","section":"Section 5, paragraph after Eq. (5.2)"},{"comment":"The inference 'Taking the limit of n in Equations 5.3 and 5.4 yields ... Thus, for n large enough, the only solution to this system is given by the constant solution a=b' is not valid as written. A system of equations that converges to a limiting system with a unique solution can have additional solutions for every finite n that converge to the limiting solution; ruling this out requires a quantitative separation of roots or a uniform monotonicity/continuity argument. The order of limits is also ambiguous because the eventual claim involves both n→∞ and α→∞. Without this step, even within the two-block ansatz the conclusion that only the constant solution exists for large n is unproved.","section":"Section 5, paragraph after Lemmas 5.1 and 5.2"}],"minor_comments":[{"comment":"The phrase 'Without loss of generality, take n even' is inaccurate: the subsequent two-block assumption with exactly n/2 entries per block is not a consequence of parity, and the odd-n variant should be stated explicitly.","section":"Section 5, first paragraph"},{"comment":"The block vector Xq is stated to have at most (1+4/δ)^{2(k+1)} communities, but since each Xq_j is an inner product of a single net point uq with one of the net points vq_j, the bound |T|=(1+4/δ)^{k+1} values already suffices; the square is harmless but should be corrected for accuracy.","section":"Section 4, proof of Theorem 4.4"},{"comment":"The text says that 'for simplicity' it considers equations for α>0 after assimilating the factor 3 inside α; this sign and factor change from the Hamiltonian in Eq. (5.1) should be written out explicitly, so the reader can verify that α→∞ in Eqs. (5.3)-(5.4) corresponds to α→-∞ in Eq. (5.1).","section":"Section 5, before Eqs. (5.3)-(5.4)"},{"comment":"The notation log_{Dα} ε is used without defining the convention for the fractional base Dα<1; since the logarithm is decreasing in the base, this is a common source of sign errors. Please spell out the definition and the resulting exponent explicitly.","section":"Theorem 4.7 and Remark 1"},{"comment":"The proof sketch does not explain how the n^{7/8} term from Theorem 4.4 is absorbed to obtain the claimed δn bound for every n, including small n; a one-sentence argument (for example, choosing Cδ to cover the finite initial segment and then using the n^{7/8} term for large n) would remove ambiguity.","section":"Corollary 4.5"},{"comment":"There are several typographical slips, including 'distribtions' in reference [7], 'Morever' at the end of Section 2.1, and missing spaces in 'Erdős-Rényi'; these should be corrected in revision.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The structural results in Sections 3 and 4 are the paper's main contribution and appear sound. The triangle section's conclusion is not supported as stated; I would suggest that the authors either prove the exhaustiveness of the two-block ansatz or explicitly reformulate the triangle result as conditional on that ansatz, adjusting the abstract accordingly. With that change the paper would be a solid contribution to the vertex-weighted ERGM literature."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, the punchline: the core of this paper is a legitimate, carefully executed extension of the Eldan–Gross decomposition to vertex-weighted ERGMs with clique-counting Hamiltonians. The main theorems in Sections 3 and 4 are sound as far as I can tell: the bounds on gradient complexity, the Lipschitz constants, and the Johnson–Lindenstrauss argument in Theorem 4.4 all track the cited framework, and the vertex-weighted setting is a genuine generalization, not a restatement. Theorems 4.7 and 4.9 give clean uniqueness results for positive and small weights, and Corollary 4.5 is the practical payoff: the model is close to a mixture supported on block vectors with a number of communities independent of n. The sparse example in 4.8 is a nice touch and shows the bounds can be meaningful outside the dense regime.\n\nNow the soft spot, and it is load-bearing. Section 5, the triangle case, assumes that a solution to the fixed-point equation has the form (a,...,a,b,...,b) with two equal-sized blocks, and then analyzes only that. The concluding statement that “for n large enough, the only solution to this system is the constant solution a=b” is only proved within that ansatz. Exchangeability does not force equal-size two-block structure; non-symmetric block sizes, multi-block solutions, or non-block vectors are not handled. The limiting argument after taking n to infinity shows the symmetric two-block solutions collapse, but it does not rule out other fixed points. Since Theorem 4.4 only guarantees closeness to some block vector with C_δ communities, it cannot reduce the general case to this two-block analysis. So the abstract’s claim that the solution of the vector equation tends to zero as the triangle weight diverges is not established for the full equation.\n\nIs this a manufactured concern? No. The unweighted edge-triangle model is known to have non-constant two-community solutions, so the vertex-weighted case genuinely needs an argument ruling those out, or a more modest claim. The rest of the paper does not depend on Section 5, and the main dimension-reduction theorems stand on their own.\n\nWho should read this: people working on ERGMs, graph limits, or practical dimension reduction for network models. It deserves a serious referee. I would recommend sending it out, with the expectation that Section 5 gets a major revision or its claim gets weakened. I’d engage with it myself.","headline":"Solid extension of Eldan–Gross to vertex-weighted ERGMs, but the triangle-case collapse claim rests on an unproved two-block ansatz and needs fixing.","tokens_in":20678,"tokens_out":3254,"would_cite":true,"duration_ms":31330,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C80","60C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Vertex-weighted random graph models reduce to block-vector mixtures","keywords":["exponential random graphs","vertex-weighted graphs","stochastic block model","dimension reduction","fixed-point equation","clique counts","triangle model","graph limits"],"falsifier":"Run Newton iteration or a homotopy continuation for the fixed-point equation of the triangle Hamiltonian at $n=6$ and $n=8$ with large positive weight $\\alpha$ (say $10^4$ to $10^6$), starting from many random initial vectors in $[0,1]^n$ that are not of the two-block symmetric form; if any computed solution has positive $\\ell^1$ distance from the zero vector as $\\alpha$ grows, the triangle-case conclusion fails, while if all solutions found collapse to zero the ansatz-based conclusion is supported but not proven.","tokens_in":19697,"feed_emoji":"🧩","tokens_out":6939,"duration_ms":61858,"temperature":0.7,"pith_summary":"The paper shows that a vertex-weighted exponential random graph model whose Hamiltonian is a weighted sum of normalized clique counts is, in $\\ell^1$-norm distance, almost a mixture whose building blocks are block vectors with a number of communities that does not grow with the number of vertices $n$. The reason is that nearly all probability mass sits on configurations that almost solve a vector fixed-point equation, and every solution of that equation is close to a low-community block vector. In the positive-weight and small-weight regimes the mixture collapses further: every near solution is close to one constant vector, so the model behaves like a weighted analogue of $G(n,p)$. For the triangle-only Hamiltonian, the paper finds that the constant solution moves to the zero vector as the triangle weight diverges, so the model concentrates on the empty configuration rather than forming the two-community structures seen in ordinary edge-triangle ERGMs. If correct, this gives a dimension reduction: an $n$-vertex weighted model is governed by a constant number of community weights.","feed_headline":"Weighted random graph models collapse to a few blocks","feed_subtitle":"An n-vertex model sits within o(n) of a fixed number of community weights, so big networks shrink to simple summaries.","key_machinery":"The load-bearing object is the fixed-point map $\\Phi(X)=(1_n+\\tanh(\\nabla f(X)))/2$ on $[0,1]^n$, where $\\nabla f$ is the discrete gradient of the Hamiltonian. The paper shows via gradient-complexity bounds and a Johnson-Lindenstrauss projection that the set $\\mathcal{X}^f$ of near fixed points of $\\Phi$ carries almost all mixture mass, that each near fixed point is close to a block vector (a vector taking only a fixed number of distinct values) with $O_\\delta(1)$ communities, and that under positivity or small-weight conditions $\\Phi$ is contracting toward a single constant vector. In the triangle case the machinery is a two-block symmetric reduction of the fixed-point equations plus Lambert-$W$ estimates that pin down how the block values collapse to zero.","core_discovery":"For Hamiltonians of the form $f(X)=\\log(p/(1-p))\\|X\\|_1 + \\sum_q \\alpha_q n^{1-m_q}\\sum_{i_1\\ne\\cdots\\ne i_{m_q}} X_{i_1}\\cdots X_{i_{m_q}}$, the random vertex-weight vector $X_n^f$ is a $(\\rho, 80C_\\alpha^{1/4}n^{-1/8})$-mixture, with $\\rho$ putting mass at least $1-80C_\\alpha^{1/4}n^{-1/8}$ on the set $\\mathcal{X}^f$ of near fixed points of $X=(1_n+\\tanh(\\nabla f(X)))/2$ (Theorem 4.1). Every $X\\in\\mathcal{X}^f$ is within $\\delta n + 5000C_\\alpha^2 n^{7/8}$ in $\\ell^1$-norm of a block vector with at most $C_\\delta$ communities (Theorem 4.4), giving Corollary 4.5: the model couples in expectation within $\\delta n$ to $G(n,\\rho)$ supported on such block vectors. With all $\\alpha_q\\ge 0$ and a unique attractive fixed point $x$ of the scalar map $\\phi_\\alpha$, every near solution is within $\\varepsilon n + O(n^{7/8})$ of the constant vector $x1_n$ (Theorem 4.7); with small weights $J_\\alpha<1$ the same conclusion holds with an explicit $n^{7/8}$ rate (Theorem 4.9). For the triangle Hamiltonian, under a two-block symmetric ansatz, the fixed-point equations reduce to a pair of scalar equations, and as the triangle weight diverges the solutions $a,b$ tend to $0$, with polynomial upper and exponential lower decay rates (Lemmas 5.1 and 5.2); in the $n\\to\\infty$ limit the only solution is the constant vector, which tends to the zero vector.","pith_inferences":["The same fixed-point-plus-projection argument would likely apply to Hamiltonians that are symmetric functions of vertex weights other than clique counts, since the proof uses only Lipschitz and gradient-complexity bounds; a testable extension is to degree-based or two-star weighted Hamiltonians.","The contrast with the unweighted triangle ERGM suggests vertex weights themselves may suppress symmetry breaking; one could test this by adding a tiny vertex-weight field to the unweighted edge-triangle model and checking whether the two-community phase disappears.","Remark 1's explicit $cn^{15/16}$ rate in the positive-weight regime suggests that distributional limit theorems for clique counts might be provable in this near-$G(n,p)$ regime; this is an extrapolation beyond the paper's statements.","Because the triangle-case conclusion rests on the two-block symmetric ansatz, a natural next step is a numerical or rigorous search for non-symmetric fixed points; if any exist at large weight, the zero-vector conclusion would need qualification."],"forward_implications":["An $n$-vertex vertex-weighted ERGM with a clique-counting Hamiltonian can be summarized by a constant number of community weights; the $\\ell^1$ error is $o(n)$, so dimension reduction is asymptotically lossless.","Under positive clique weights with a unique scalar fixed point, the model is within $o(n)$ of a constant-weight configuration $x1_n$, so it behaves like a weighted Erdős–Rényi model with a single edge probability.","Under the small-weight condition $J_\\alpha<1$, the approach to the constant vector is quantitative: every near fixed point lies within $O(n^{7/8})$ of $x1_n$.","For the triangle-only Hamiltonian with diverging triangle weight, the vertex-weighted model concentrates on the empty configuration instead of developing the nontrivial two-community structure of the unweighted edge-triangle ERGM.","The sparse example with $p=n^{-d}$ and $\\alpha\\approx\\log n$ shows the bounds remain meaningful when the graph is sparse, as long as $p\\gtrsim n^{-1/8}$; in that regime the model couples to $G(n,p)$ with expected $\\ell^1$ error $o(np)$."],"supporting_citations":[{"why":"Supplies the mixture-of-stochastic-block-models framework and the Lemmas 30 and 33 that the vertex-weighted proofs adapt.","marker":"[8]"},{"why":"Provides Theorem 9, the decomposition of mean-field Gibbs distributions into product measures that yields the near-fixed-point mixture structure.","marker":"[7]"},{"why":"Supplies the Johnson–Lindenstrauss-style projection lemma used to show near fixed points are close to low-community block vectors.","marker":"[5]"},{"why":"Supplies the delta-net covering bound used to control the number of communities in the projected block vectors.","marker":"[16]"},{"why":"Supplies the Lambert-W inequalities used to bound the decay rate of the triangle-case solution.","marker":"[12]"},{"why":"Provides the graphon variational framework and the Erdős–Rényi phase-transition results that motivate the comparison with unweighted ERGMs.","marker":"[2]"}],"fun_headline_variants":["Vertex-weighted random graphs collapse to few blocks","Weighted graphs are near mixtures of block models","Near fixed points imply a handful of communities","Triangle Hamiltonian drives weights to zero","Vertex weights reduce to fixed-point blocks"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The triangle-case conclusion assumes that a solution to the fixed-point equation has the two-block symmetric form (first $n/2$ entries equal to $a$, rest equal to $b$), stated after Equation 5.2; if non-symmetric or multi-block solutions exist, the claim that the only solution tends to zero is not proved.","fun_headline_variants_meta":{"raw":{"variants":["Vertex-weighted random graphs collapse to few blocks","Weighted graphs are near mixtures of block models","Near fixed points imply a handful of communities","Triangle Hamiltonian drives weights to zero","Vertex weights reduce to fixed-point blocks"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00067,"raw_usage":{"total_tokens":3127,"prompt_tokens":1091,"completion_tokens":2036,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":707,"completion_tokens_details":{"reasoning_tokens":1972}},"tokens_in":707,"tokens_out":2036,"duration_ms":15427,"temperature":1.0,"reasoning_tokens":1972,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:36:34.489192+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run Newton iteration or a homotopy continuation for the fixed-point equation of the triangle Hamiltonian at $n=6$ and $n=8$ with large positive weight $\\alpha$ (say $10^4$ to $10^6$), starting from many random initial vectors in $[0,1]^n$ that are not of the two-block symmetric form; if any computed solution has positive $\\ell^1$ distance from the zero vector as $\\alpha$ grows, the triangle-case conclusion fails, while if all solutions found collapse to zero the ansatz-based conclusion is supported but not proven.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the mixture-of-stochastic-block-models framework and the Lemmas 30 and 33 that the vertex-weighted proofs adapt."},{"cited_title":"Electron","cited_arxiv_id":null,"evidence_quote":"Provides Theorem 9, the decomposition of mean-field Gibbs distributions into product measures that yields the near-fixed-point mixture structure."},{"cited_title":"Random Structures Algorithms 22: 60-65 (2003)","cited_arxiv_id":null,"evidence_quote":"Supplies the Johnson–Lindenstrauss-style projection lemma used to show near fixed points are close to low-community block vectors."},{"cited_title":"Springer- Verlag New York Inc","cited_arxiv_id":null,"evidence_quote":"Supplies the delta-net covering bound used to control the number of communities in the projected block vectors."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Lambert-W inequalities used to bound the decay rate of the triangle-case solution."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the graphon variational framework and the Erdős–Rényi phase-transition results that motivate the comparison with unweighted ERGMs."}],"review_version":1}