{"id":"67ba7a12-43dc-4eca-abc3-8d53f3d09256","arxiv_id":"2412.14512","paper_version":2,"verdict":"REJECT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"Convergence of many interacting agents with non-identical connection weights to a deterministic Vlasov limit is proved using a distance that couples optimal transport and graph fractional isomorphism.","lead":"This paper shows that a large group of agents with non-identical connection strengths converges, over time, to a deterministic Vlasov equation describing the whole crowd. It introduces a new distance that combines optimal transport and graph similarity to make this convergence hold for the actual evolving states, not only for averaged probability laws.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 2.29's 'moreover' is false: cut-distance limits of kernels δ_{X^(n)(ζ)} can be non-atomic, so the proof of Theorem 1.7 does not construct the claimed deterministic Dirac-type limit.","rationale":"The reader's weakest_assumption identifies exactly the load-bearing failure: Lemma 2.29's 'moreover' is used to pass from an abstract cut-distance limit to a pair (w^(∞),X^(∞)_0) with Dirac fibers, which is required for the stability input of Lemma 2.28 and hence for the conclusion of Theorem 1.7. The oscillating-X example shows the claimed representation is false in general, because the cut limit can be a constant Lebesgue measure rather than a Dirac kernel. This is a concrete internal inconsistency in the proof, not a disagreement with an external consensus. I am not persuaded that the main theorem is false—there may be a repair via the lifting construction in Definition 1.6—but the current manuscript does not contain that repair, and the false lemma is essential to the written proof. The paper's Appendix A machinery is substantial and seems orthogonal to the failure, and the graphon counting lemmas are plausible, but neither supplies the missing identification. I therefore keep the reader's REJECT verdict: the central claim is not established as written.","tokens_in":72665,"tokens_out":14908,"duration_ms":135764,"concrete_test":"Run the explicit analytical check: set X_n(ξ)={nξ}, w≡1, and verify that for every measurable X:[0,1]→T, the cut-norm distance δ□;H(k_n, w_{w,X}) has liminf at least 1/4 using S=[0,1], T_0=X^{-1}([0,1/2]), and e=1_{[0,1/2]}. Then trace the paragraph in Section 2.5 where Lemma 2.29's 'moreover' is used to set w^(∞)=w_{w,X}; if no alternative argument supplies the pair (w^(∞),X^(∞)_0), the compactness step of Theorem 1.7 fails. A repair may be possible by proving compactness directly in the coupling distance γ□;H and using the f-lift of Definition 1.6, but that proof is not present in the manuscript.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Lemma 2.29's 'moreover' is false as stated. Let I=[0,1], D=T, w^(n)≡1, and X^(n)(ξ)={nξ} mod 1, with k_n = w_{w^(n),X^(n)} as in Definition 2.21. For any measurable S,T⊂[0,1] and any test function e in the first coordinate, ∫_{S×T} e d(k_n)_1 = |S| ∫_T e({nζ}) dζ, which converges by equidistribution to |S||T|∫_T e. Thus the cut-distance limit of k_n is the constant non-atomic kernel (Leb_T, Leb_T), not (δ_{X(ζ)}, δ_{X(ζ)}). No measurable X:[0,1]→T can represent this limit: choose A=[0,1/2], T_0=X^{-1}(A), S=[0,1], e=1_A; for the X-term the integral over T_0 equals |T_0|, while the k_n-term converges to |T_0||A|, giving a cut-norm gap at least |A|(1−|A|)=1/4. This matters because Section 2.5 proves Theorem 1.7 by invoking Lemma 2.29 for compactness and then uses its 'moreover' to identify the limiting pair (w^(∞),X^(∞)_0) that feeds into Lemma 2.28. Without that identification, the deterministic limit in Theorem 1.7 is not constructed. The stability and hierarchy arguments in Appendix A appear independent of this step, but the compactness/identification step is load-bearing and unsupported as written.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes a bi-coupling distance between non-exchangeable multi-agent systems that interpolates Wasserstein-1 optimal transport and graph fractional-overlay distances, and claims a strong mean-field limit on empirical data: convergence of connection weights and initial data in this distance implies convergence at any later positive time, in expectation, to a deterministic extended Vlasov solution. The proof is organized around tensorized graph homomorphism observables, a BBGKY-type hierarchy with negative Sobolev energy estimates, and compactness and counting/inverse counting lemmas in a Hilbert-space-valued graphon setting.","tokens_in":73023,"tokens_out":7398,"duration_ms":67999,"significance":"The conceptual package is attractive: a convex a posteriori correspondence on empirical data, a hierarchy of tensorized observables connecting kinetic theory and graph limit theory, and detailed extensions of BBGKY and graphon arguments. The Appendix A energy estimate for observables is substantial, and the fractional-isomorphism machinery in Appendix C is broadly relevant. However, the central compactness claim is false as stated, and because that claim is used to construct the deterministic limit in Theorem 1.7, the advertised main theorem does not follow. The failure is not cosmetic; it concerns the existence and structure of the limit object.","major_comments":[{"comment":"The 'Moreover' part of Lemma 2.29 is false as stated. Let I=[0,1], w^(n)≡1, X^(n)(ξ)={nξ} mod 1, and let k_n=w_{w^(n),X^(n)} as in Definition 2.21. For measurable S,T⊂[0,1] and a test function e in the first coordinate, ∫_{S×T} e d(k_n)_1 = |S|∫_T e({nζ}) dζ, which by equidistribution tends to |S||T|∫_T e. Thus a cut-distance limit of k_n is the constant non-atomic kernel (Leb_T,Leb_T), which is not of the form (δ_{X(ζ)}, w(ξ,ζ)δ_{X(ζ)}) for any measurable X. No measurable selection X can represent this limit: for A⊂T and T_0=X^{-1}(A), the cut-norm gap is at least |A|(1−|A|). Consequently, Lemma 2.29 cannot supply the limit pair (w^(∞),X^(∞)_0) used in the proof of Theorem 1.7.","section":"Lemma 2.29 (Section 2.5) and Appendix B, Lemma B.6"},{"comment":"The compactness assertion of Theorem 1.7 is false for uniformly bounded oscillating initial data of the type above. The proof of Theorem 1.7 invokes Lemma 2.29 for compactness and then uses its 'Moreover' statement to identify the limiting pair (w^(∞),X^(∞)_0) that is fed into Lemma 2.28. Since that identification step is invalid, the theorem does not construct the asserted Dirac-type deterministic limit. The stability statement conditional on a given Dirac-limit pair may be salvageable, but the theorem as stated claims automatic existence of such a limit for every bounded sequence, and this claim fails.","section":"Theorem 1.7, compactness bullet"},{"comment":"The failure cannot be repaired simply by enlarging the limit class to non-Dirac fiberwise laws. Lemma 2.15's proof relies on Part 5 of Lemma 2.12, namely that Dirac deltas are the unique maximizers of the H^{-1}(T) norm. If the limit kernel is a non-atomic mixture such as (Leb_T,Leb_T), the equivalence between the bi-coupling distance and the coupling distance γ_{□;H} is no longer justified by the present arguments. Thus the false 'Moreover' in Lemma 2.29 is load-bearing not only for the compactness statement but also for the metric framework supporting Theorem 1.7.","section":"Section 2.3, Lemma 2.15"}],"minor_comments":[{"comment":"In the iterated estimate, the text says 'we let m → 0'; the intended limit is m → ∞, and as written the conclusion is vacuous.","section":"Proof of Lemma 2.28, Appendix A.2"},{"comment":"The subsection heading reads 'Proof of Lemma 2.25', but the statement being proved is Proposition 2.25; the cross-reference labels should be harmonized.","section":"Section 3.4"},{"comment":"Definition 2.21 is presented as a restatement of Definition 2.14, but the codomain changes from H^{-1}(T)⊕H^{-1}(T) to M(T)⊕{0,1}; the inclusion and the notational switch should be stated explicitly.","section":"Definitions 2.14 and 2.21"},{"comment":"The funding statement contains a malformed string 'Marie Sk/suppress lodowska-Curie' that should be corrected.","section":"Acknowledgments"},{"comment":"Several references to [18] point to unnumbered claims such as 'Claim 6.9' and 'Proposition 6.6'; precise bibliographic pointers would help the reader verify the cited statements.","section":"Appendix C"}],"recommendation":"reject","confidential_remarks":"The false compactness lemma is the main obstruction. The counterexample is simple and lies squarely within the assumptions of Theorem 1.7, so I do not see a local repair. A revised paper might restrict the main theorem to sequences already known to converge to a Dirac-lift limit, or expand the limit class to non-atomic measure-valued kernels and rebuild the metric equivalence; either change substantially alters the advertised result."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The real news: the paper has a genuinely new idea—the bi-coupling distance, the lift construction, and the observable hierarchy that tensorizes agent laws with graph homomorphism densities. Lemmas 2.30 and 2.31, extending counting and inverse counting to tree homomorphisms and coupling distances, are valuable and appear correct. Appendix A's BBGKY stability argument is detailed, honest about its debts to Jabin–Zhou, and looks independent of the bad step. This is not a throwaway paper.\n\nThe soft spot is load-bearing. Lemma 2.29 claims that every cut-distance limit of kernels of the form w_{w,X} is again of that form, for some measurable X. That claim is false. Take w^(n) ≡ 1 and X^(n)(ξ) = nξ mod 1. The kernels δ_{X^(n)(ζ)} converge in cut distance to the constant non-atomic kernel Leb_T ⊗ Leb_T, not to δ_{X(ζ)} for any measurable X. The stress-test note is correct, and the counterexample lands directly on Section 2.5: the proof of Theorem 1.7 uses Lemma 2.29's 'moreover' to name the limiting pair that feeds into Lemma 2.28. Without that identification, the compactness part of Theorem 1.7 does not construct the claimed deterministic Dirac-type limit, and the stability statement has no target to converge to.\n\nIs this repairable? Probably, but not trivially. The fix likely means proving compactness at the level of observables and then constructing the limiting extended density f, which may be non-atomic, rather than forcing a Dirac-valued X. That is a substantial revision, not a typo.\n\nThe rest of the manuscript is mostly sound: the distance definitions are coherent, the equivalence results are carefully argued, and the citations are honest, including the author's own prior work. The conclusion section also flags real limitations, such as the lack of rates.\n\nWho should read it: people working on mean-field limits of non-exchangeable systems or on graph limits. It is worth a reading group discussion, mainly as an example of a promising framework with a subtle compactness trap.\n\nMy recommendation: send it to a serious referee, not a desk reject. The paper deserves expert time, and the stability part may survive. But I would not cite Theorem 1.7 in its current form, and the manuscript needs major revision before the main result can be accepted.","headline":"Novel distance and stability framework, but Lemma 2.29's 'moreover' is false, so Theorem 1.7 as stated is not proved.","tokens_in":73542,"tokens_out":7185,"would_cite":false,"duration_ms":69311,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35Q83","82C40","05C80"],"pacs":[],"model":"deepseek-v4-flash","headline":"Convergence of agent weights and states in one interpolated distance forces convergence of the whole empirical dynamics to an extended Vlasov limit.","keywords":["mean-field limit","non-exchangeable multi-agent systems","bi-coupling distance","extended Vlasov equation","observables","graphon theory","fractional isomorphism","tensorized graph homomorphism densities"],"falsifier":"Compute the cut-distance limit for the sequence w^(n) = 1, X^(n)(xi) = n*xi mod 1 on [0,1]: the first component delta_{X^(n)(zeta)} converges in the cut norm to Lebesgue measure on T, not to any delta_{X(zeta)}. Since this limit is not of Dirac-kernel form, the 'moreover' part of Lemma 2.29 is false unless some additional structure rules out such oscillations; that settles whether the compactness step, and hence the deterministic-limit statement, can stand as written.","tokens_in":72458,"feed_emoji":"🕸️","tokens_out":7848,"duration_ms":72621,"temperature":0.7,"pith_summary":"This paper argues that non-exchangeable multi-agent systems—networks in which every ordered pair of agents can interact with its own strength—possess a mean-field limit of a strong kind: if the connection weights and initial states of a sequence of systems converge together in a specially designed bi-coupling distance, then at every later time the empirical state configuration converges, in expectation over the noise, to the deterministic solution of an extended Vlasov equation. It matters because previously available mean-field limits for such systems required an a priori matching of each agent to a label in a continuum, a matching that is unnatural when agents are not interchangeable and that prevents convergence of the empirical data itself. The bi-coupling distance interpolates the Wasserstein-1 distance between agent states and a fractional-overlay (operator commutator) distance between weighted graphs, so a single coupling gamma both transports agents and measures how much the graph structures fail to commute through the transport. The proof identifies convergence in this distance with convergence of a hierarchy of observables—weighted, tensorized moments of the empirical measure that are exactly graph homomorphism densities—and shows this hierarchy is stable. Axiomatically, the work puts the mean-field limit of non-exchangeable systems on an a posteriori correspondence footing: the best matching of agents to the limit can vary with time and with the realization of randomness.","feed_headline":"One distance unifies agent swarms and graph limits","feed_subtitle":"Converging weights and states force large swarms toward a deterministic Vlasov limit, in expectation.","key_machinery":"The load-bearing object is the bi-coupling distance d_{Lp->Lq,W1}, the infimum over couplings gamma of a Wasserstein-1 state cost plus two operator norms ||w^(1)gamma - gamma w^(2)|| and ||gamma^T w^(1) - w^(2) gamma^T||; on discrete systems this is a convex optimization problem that degenerates to the Wasserstein distance when all weights are equal and to the fractional-overlay graph distance when all states coincide. Around it, the proof builds three linked structures: (1) the lifted kernel w_{w,X} in L^infty(I x I; $H^{{-1}}$(T) oplus $H^{{-1}}$(T)) with entries delta_{X(zeta)} and w(xi,zeta) delta_{X(zeta)}, which makes the bi-coupling distance topologically equivalent to a coupling distance gamma_{D,H} between such kernels; (2) the observables tau(T,w,X), defined as weighted sums over distinct k-tuples of agents with weights product w_{i,j} on tree edges, which are simultaneously k-particle marginals and tensorized graph homomorphism densities; (3) the functional-valued Counting Lemma and Inverse Counting Lemma, which show convergence of all tree observables is equivalent to gamma_{D,H}-convergence. The hierarchy of linear PDEs that the observables solve is then closed on oriented trees, and its energy estimates in $H^{{-1}}$(T)^{tensor v'(T)} give the stability in expectation that the theorem states.","core_discovery":"The central claim is Theorem 1.7: on the torus T with mu in $W^{{1,infty}}$, $\\sigma$ in $W^{{2,infty}}$, and noise intensity nu >= 0, if the initial pairs (w^(n), X_0^(n)) converge to a limit (w^(infty), X_0^(infty)) in the bi-coupling distance d_{L2->L2,W1}, then at any later time t > 0 the expected bi-coupling distance between the system's state and the limit lift vanishes: lim_{n->infty} E[d_{L2->L2,W1}((w^(n),X^(n)(t)),(w^(infty),X^(infty)(t)))] = 0. The discovery is that this convergence for empirical data—Dirac masses moving under the SDE or ODE—is proved by passing through the observables: for every oriented tree T, the weighted empirical sum tau(T,w,X) satisfies a closed hierarchy of linear transport equations whose energy estimates in tensorized $H^{{-1}}$(T) are stable. The graph-theoretic input is that the family of all observable limits is equivalent, via functional-valued Counting and Inverse Counting Lemmas, to convergence in the coupling distance induced by the bi-coupling distance. In this sense, kinetic theory and graph limit theory meet at the level of tree-indexed tensorizations: the dynamics of a swarm of distinguishable agents is controlled by the homomorphism densities of its interaction graph.","pith_inferences":["If the compactness lemma's 'moreover' part can be repaired, the same program should carry over to T^d and to rougher kernels by raising the Sobolev exponent s beyond d/2; the paper's own outlook section notes that required commutator estimates grow with dimension.","Because the bi-coupling distance is a convex program, it suggests a numerical workflow the paper does not run: given two snapshots of a large network, compute the optimal coupling gamma, read off the time-dependent correspondence between agents, and test whether the system is near its Vlasov limit.","The equivalence between tree observables and fractional overlay suggests that network comparison for dynamics should use fractional isomorphism classes rather than graph isomorphism; spectral fingerprints of trees could serve as practical observable statistics.","A compactness-free proof of the Inverse Counting Lemma for trees would turn the current qualitative convergence into an explicit rate, a direction the paper explicitly leaves open in Remark 2.32."],"forward_implications":["If two systems have fractionally isomorphic connection graphs (identical tree homomorphism densities) and suitably close initial data, their large-scale dynamics coincide in the bi-coupling distance; no agent-to-agent isomorphism is required.","The mean-field limit holds at the level of empirical realizations, not just one-particle laws, because the theorem bounds the expected distance between Dirac empirical measures and the deterministic Vlasov lift for every t > 0.","Any sequence of uniformly bounded weights and deterministic initial data has a subsequence that is Cauchy in the bi-coupling distance, so the theorem's hypotheses reduce to a checkable compactness condition.","Finite-agent systems and continuum (Vlasov) initial data are treated in one framework: the lift in Definition 1.6 converts a law f into a state map X so that both live in the same space of pairs (w,X).","The stability in the observable metric is quantitative enough to imply well-posedness of the extended Vlasov equation itself, so the limit system is not just an abstract object."],"supporting_citations":[{"why":"Supplies the compactness of graphons in the unlabeled cut distance, the starting point for Lemma 2.29.","marker":"[29]"},{"why":"Provides the classical Counting Lemma and Inverse Counting Lemma that Lemma 2.30 extends to Hilbert-valued kernels.","marker":"[8]"},{"why":"Introduces the observable hierarchy for non-exchangeable mean-field limits, whose stability estimates Lemma 2.28 reproves in H^{-1}.","marker":"[19]"},{"why":"Supplies the BBGKY-hierarchy and negative-Sobolev energy estimates that Appendix A adapts to the present dynamics.","marker":"[21]"},{"why":"Establishes fractional isomorphism of graphons via tree homomorphism densities and fractional overlays, the basis of Lemma 2.31.","marker":"[18]"},{"why":"Provides the metrics relaxing fractional isomorphism that upgrade the pointwise equivalence into the topological equivalence needed in Lemma 2.31.","marker":"[5]"}],"fun_headline_variants":["One metric links particle swarms and graph limits","Kinetic theory and graphs meet via a bi-coupling distance","Tree observables tie mean-field limits to graph limits","Rich swarms converge to Vlasov via graph-like distances","New proof unifies non-exchangeable swarms and graph limits"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument depends on the compactness lemma's extra claim that whenever the kernels built from (w^(n), X^(n)) converge in cut distance, the limit can again be written as w_{w,X} for some measurable state map X; if oscillating state sequences produce cut-distance limits that are diffuse measures, the deterministic limit used in Theorem 1.7 may fail to exist.","fun_headline_variants_meta":{"raw":{"variants":["One metric links particle swarms and graph limits","Kinetic theory and graphs meet via a bi-coupling distance","Tree observables tie mean-field limits to graph limits","Rich swarms converge to Vlasov via graph-like distances","New proof unifies non-exchangeable swarms and graph limits"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.0002,"raw_usage":{"total_tokens":1382,"prompt_tokens":961,"completion_tokens":421,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":577,"completion_tokens_details":{"reasoning_tokens":340}},"tokens_in":577,"tokens_out":421,"duration_ms":4281,"temperature":1.0,"reasoning_tokens":340,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T12:13:25.850135+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the cut-distance limit for the sequence w^(n) = 1, X^(n)(xi) = n*xi mod 1 on [0,1]: the first component delta_{X^(n)(zeta)} converges in the cut norm to Lebesgue measure on T, not to any delta_{X(zeta)}. Since this limit is not of Dirac-kernel form, the 'moreover' part of Lemma 2.29 is false unless some additional structure rules out such oscillations; that settles whether the compactness step, and hence the deterministic-limit statement, can stand as written.","supporting_citations":[{"cited_title":"Lov ´asz and B","cited_arxiv_id":null,"evidence_quote":"Supplies the compactness of graphons in the unlabeled cut distance, the starting point for Lemma 2.29."},{"cited_title":"Borgs, J","cited_arxiv_id":null,"evidence_quote":"Provides the classical Counting Lemma and Inverse Counting Lemma that Lemma 2.30 extends to Hilbert-valued kernels."},{"cited_title":"Jabin, D","cited_arxiv_id":null,"evidence_quote":"Introduces the observable hierarchy for non-exchangeable mean-field limits, whose stability estimates Lemma 2.28 reproves in H^{-1}."},{"cited_title":"Greb ´ık and I","cited_arxiv_id":null,"evidence_quote":"Establishes fractional isomorphism of graphons via tree homomorphism densities and fractional overlays, the basis of Lemma 2.31."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the metrics relaxing fractional isomorphism that upgrade the pointwise equivalence into the topological equivalence needed in Lemma 2.31."}],"review_version":1}