{"id":"61483c4a-6a8f-4060-893e-bfce23881a66","arxiv_id":"2607.05425","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Approximate lumping of Markov chains by vertex-and-edge counts yields density-dependent processes whose large-N limits recover classical edge-based mean-field ODEs for network dynamics.","lead":"The paper derives edge-based mean-field ODEs for Markov dynamics on networks by partitioning the full state space by vertex and edge counts and averaging transition rates. This makes the averaging step explicit and recovers classical pairwise approximations as special cases on cycles, random-regular and Erdős–Rényi graphs.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The reader's strongest claim accurately summarises what the paper delivers: a systematic derivation that recovers the classical pairwise equations for three standard families without invoking moment-closure postulates. The weakest assumption identified by the reader (density-dependence on general graphs) is indeed left open, but the paper never claims that property beyond the cases it treats; the claim therefore stands on the completed derivations. No load-bearing technical flaw was found that would alter the ACCEPT verdict or lower confidence. The suggested verification simply re-checks the most intricate combinatorial step already used for the cycle, providing an independent sanity check rather than a new objection.","tokens_in":26349,"tokens_out":419,"duration_ms":4248,"concrete_test":"Independently recompute the cycle microstate counts N(s) and Nv(A,d,s) for N=6 (Appendix A) and verify that the resulting q-matrix (Eqs. 26–27) produces the same stationary y_I as the full 2^6 generator; agreement within machine precision confirms the combinatorial step that underpins the subsequent ODE recovery.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is that edge-based approximate lumping (partitioning by vertex- and edge-state counts, averaging rates via the uniform distributor) yields density-dependent processes whose large-N limits recover classical homogeneous pairwise mean-field ODEs on the treated families. The derivations for the cycle (Eqs. 29–33), random-regular ensemble (Eqs. 41–45) and Erdős–Rényi ensemble (Eqs. 61–65) are complete, self-contained and match known results; the only material open point (density-dependence for arbitrary graphs) is explicitly flagged by the authors and is not required for the claim as stated. No hidden free parameters, circular closures or internal inconsistencies appear.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper develops a systematic approximate-lumping framework for continuous-time Markov processes on networks in which each vertex occupies one of finitely many states and transition rates depend only on the neighbour-state counts. Microstates are partitioned by the joint counts of vertices and edges in each possible state; transition rates between partitions are averaged with the uniform distributor matrix (Eqs. 4–6). The resulting edge-based population processes are density-dependent for the families treated, and their large-N limits are low-dimensional ODE systems. Explicit combinatorial counts are carried out for the cycle (Appendix A, Eqs. 23–25), the configuration-model regular ensemble (Eqs. 35–37) and the Erdős–Rényi ensemble (Eqs. 51–53). The ensuing ODEs (Eqs. 29–33, 41–45, 61–65) recover the classical homogeneous pairwise mean-field equations of Kiss–Miller–Simon, thereby placing those equations inside a principled averaging construction that begins from the exact Kolmogorov generator.","tokens_in":26550,"tokens_out":679,"duration_ms":5723,"significance":"If the derivations hold, the work supplies a transparent mathematical origin for a widely used class of edge-based mean-field models: the approximation is identified with a concrete uniform average of transition rates over microstates that share the same vertex- and edge-count vectors. This clarifies what is being averaged, opens a route to quantitative error bounds, and unifies earlier moment-closure and idealised-network derivations under a single Markov-chain construction. The combinatorial calculations for cycles, random-regular and Erdős–Rényi graphs are complete and self-contained; the recovered ODEs match known pairwise equations term-by-term, giving an independent verification of those classical systems. The framework is stated for a broad affine SVT class and is therefore of interest beyond the SISa example used for exposition.","major_comments":[],"minor_comments":[{"comment":"The abstract and introduction claim a “broad class” of models, yet all explicit derivations are restricted to binary SISa dynamics. A short remark in §3.1 or the Discussion that the same counting strategy extends verbatim to M>2 (with only notational cost) would prevent over-reading of the generality claim.","section":null},{"comment":"Figure 2(a) shows excellent agreement for small cycles but the caption does not state the precise parameter values used for the EBMF horizontal line; adding α, β, γ would aid reproducibility.","section":null},{"comment":"In §5.1 the stub-wiring versus adjacency-matrix definitions of the ensemble microstates are discussed in a long footnote; moving the essential equivalence into the main text would improve readability.","section":null},{"comment":"A few typographical inconsistencies remain (e.g., “Erd˝os-R´enyi” versus “Erdős–Rényi”, occasional missing spaces around equation references). A light copy-edit pass would remove them.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is a clean, technically solid contribution that sits comfortably within the journal’s scope. The only open mathematical point (density-dependence for arbitrary graphs) is explicitly flagged by the authors and is not required for the claims that are actually proved. I see no reason to delay publication."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The one thing worth knowing is that this paper gives a fully explicit route from the exact continuous-time Markov chain to the classical homogeneous pairwise mean-field ODEs, by partitioning microstates on both vertex counts and edge counts and averaging rates with the uniform distributor. The recovered equations (cycle, random-regular, ER) match the Kiss–Miller–Simon book term-by-term, but they appear as output rather than as an assumed closure.\n\nWhat is new is the edge-count refinement of the authors’ earlier vertex-count lumping. The combinatorial counts are careful: Appendix A for the cycle, stub-wiring for the configuration-model regular ensemble, and direct pair counting for ER. Density dependence is verified for those three families, the hypergeometric moments close cleanly, and there are no free parameters or circular fittings. The self-citations supply scaffolding, not the result. That is solid technical work.\n\nThe soft spot is real but limited: they leave open whether the lumped rates stay density-dependent on arbitrary graphs. They say so themselves in the discussion, and the claim as written only needs the three treated families. Accuracy is illustrated only for small cycles and one large SIS cycle; that is enough for a methods paper but not a full error analysis. Nothing load-bearing is broken.\n\nThis is for people who already use pairwise models and want a clearer mathematical origin story, or who want a systematic way to generate higher-resolution lumpings later. It deserves a serious referee. I would accept it for peer review and would cite the derivation route when I next need to justify a pairwise approximation.","headline":"Clean, self-contained derivation that recovers classical pairwise ODEs from exact Markov-chain lumping; the open density-dependence claim is flagged and does not undercut the stated results.","tokens_in":27106,"tokens_out":409,"would_cite":true,"duration_ms":4779,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"Edge-based lumping of network Markov chains recovers classical pairwise mean-field ODEs by averaging transition rates over vertex-and-edge counts.","keywords":["mean-field approximations","networks","network epidemiology","Markov chains","lumping","edge-based models","density-dependent processes","pairwise equations"],"falsifier":"Compute the exact lumped generator for a small non-regular, non-tree network (for example a 20-vertex graph with heterogeneous degrees) and test whether the transition rates, when scaled by system size, converge to N-independent functions of the density vector; if they do not, the density-dependent reduction fails outside the treated cases.","tokens_in":27290,"feed_emoji":"🔗","tokens_out":642,"duration_ms":6236,"temperature":0.7,"pith_summary":"Mean-field equations for epidemics, opinion dynamics and spin systems on networks are used everywhere, yet it is often unclear what is being averaged when one writes them down. This paper shows that those equations can be obtained systematically from the exact continuous-time Markov chain: group every microstate that has the same numbers of vertices and edges in each state, average the transition rates between those groups with the uniform distributor matrix, and take the large-system limit. The resulting density-dependent population process collapses to a low-dimensional set of ordinary differential equations. On cycles, random regular graphs and Erdős–Rényi networks the ODEs are precisely the classical homogeneous pairwise mean-field models. Because the averaging step is made explicit, the same construction supplies a concrete route for measuring how much error the approximation introduces on any given network.","feed_headline":"Lumping recovers pairwise mean-field equations from exact Markov chains","feed_subtitle":"Averaging transitions over vertex-and-edge counts yields the classical ODEs and makes the approximation error explicit","key_machinery":"Edge-based approximate lumping: partition the microstate space so that every cell shares identical vertex-state and edge-state counts; form the reduced generator by the uniform average of transition rates out of each cell (the distributor matrix that minimises the Frobenius discrepancy); the resulting rates are density-dependent and therefore concentrate onto a deterministic ODE in the large-system limit.","core_discovery":"Approximate lumping of the exact continuous-time Markov chain that partitions microstates solely by the counts of vertices and edges of each type, then averages transition rates with the uniform distributor matrix, produces density-dependent population processes whose large-N limits are low-dimensional ODE systems that recover the classical homogeneous pairwise mean-field equations on cycles, random-regular and Erdős–Rényi networks.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Lumping by vertex-edge counts recovers pairwise mean-field ODEs","Approximate lumping turns network Markov chains into density ODEs","Averaging rates over type counts yields classical edge-based equations","Count partitions of exact chains produce homogeneous pairwise mean-fields","Lumping Markov microstates recovers edge-based approximations on ER graphs"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The claim that the averaged transition rates stay density-dependent (so that the large-system ODE limit exists) is verified only for highly symmetric graphs and ensembles; it is left open for arbitrary networks.","fun_headline_variants_meta":{"raw":{"variants":["Lumping by vertex-edge counts recovers pairwise mean-field ODEs","Approximate lumping turns network Markov chains into density ODEs","Averaging rates over type counts yields classical edge-based equations","Count partitions of exact chains produce homogeneous pairwise mean-fields","Lumping Markov microstates recovers edge-based approximations on ER graphs"]},"model":"grok-4.5","effort":"low","cost_usd":0.004664,"raw_usage":{"total_tokens":1354,"prompt_tokens":769,"num_sources_used":0,"completion_tokens":89,"cost_in_usd_ticks":46640000,"prompt_tokens_details":{"text_tokens":769,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":496,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":769,"tokens_out":89,"duration_ms":4139,"temperature":1.0,"reasoning_tokens":496,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-12T09:51:05.572342+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Compute the exact lumped generator for a small non-regular, non-tree network (for example a 20-vertex graph with heterogeneous degrees) and test whether the transition rates, when scaled by system size, converge to N-independent functions of the density vector; if they do not, the density-dependent reduction fails outside the treated cases.","supporting_citations":[],"review_version":1}