{"id":"caa82f74-808d-48e7-b5f9-9bdd7b66b9d1","arxiv_id":"2607.26709","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"An edge-adapted Markov chain with probabilistic vertex residence converges weakly to sticky/Kirchhoff network diffusions and yields a convergent fully discrete semi-Lagrangian HJB scheme.","lead":"The paper builds a Markov-chain scheme that approximates sticky and Kirchhoff diffusions on star networks, then turns it into a convergent semi-Lagrangian solver for second-order HJB equations on those networks. It gives a practical numerical path for control problems where junctions trap mass for a positive time.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The manuscript does exactly what a math.NA Markov-chain / semi-Lagrangian paper is expected to do on a star with constant per-edge diffusion: construct a non-overshooting scheme, prove tightness + generator consistency in the Ethier–Kurtz framework (separately for sticky and Kirchhoff cases), pass to the HJB scheme, and obtain viscosity convergence by monotonicity + relaxed consistency + comparison. The external citations for continuous well-posedness and comparison are standard and explicitly scoped; Remarks 3.6–3.7 already flag the finite-graph and variable-σ extensions. Numerics are qualitative only and do not prop up the theorems. Nothing in the load-bearing chain (local consistency on edges, exact hitting of O, occupation-time vanishing when η=0, Barles–Souganidis) appears internally broken. Hence the ACCEPT / moderate-confidence verdict stands without adjustment.","tokens_in":23364,"tokens_out":548,"duration_ms":11111,"concrete_test":"Independently check that the C^3_b core used in Lemmas 3.5 and the proofs of Thms 3.2/3.9 is dense in D(G) for the graph norm under (H1)–(H2) as claimed via [9]; if density fails for some admissible (b,σ,η,γ), identification of the limit would require a larger core and the convergence statements would need re-proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader's weakest-assumption note (imported well-posedness of the sticky martingale problem from [9] and comparison from an adaptation of [6]; star/constant-σ scope) is accurate as a scope caveat but is not a soft spot inside the paper's own argument. Theorems 3.2 and 3.9 establish generator consistency (uniform for η>0 via Lemma 3.5; integrated via vanishing occupation time Oh_T for η=0) and identify every weak limit as a solution of the cited martingale problem; uniqueness is then external by design. The edge-adapted lattice that hits O exactly, the geometric residence mechanism, and the Barles–Souganidis transfer for (4.9)–(4.10) are internally consistent under the stated hypotheses. No hidden contradiction or missing estimate that would overturn the central claims was found.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper constructs an edge-adapted Markov-chain approximation of sticky and non-sticky (Kirchhoff/Walsh) diffusions on a star network. On each edge the chain is a nearest-neighbor walk on the lattice with spacing σ_ι√h; at the vertex a geometric residence/re-emission mechanism encodes stickiness η and redistribution weights γ_ι. The piecewise-constant interpolation is shown to converge in D([0,T];Γ) to the target diffusion via Ethier–Kurtz (tightness by Lyapunov+Aldous; identification by uniform generator consistency for η>0 and integrated consistency plus vanishing occupation time for η=0). From the same transitions the authors derive a fully discrete semi-Lagrangian scheme for the discounted network HJB with sticky/Kirchhoff vertex condition and prove local uniform convergence to the unique bounded viscosity solution by monotonicity, contraction, and Barles–Souganidis. Numerical tests illustrate occupation time, exit probabilities, and value-function behavior.","tokens_in":23570,"tokens_out":1229,"duration_ms":24768,"significance":"The contribution is solid and useful for numerical stochastic control on networks. The edge-adapted lattice that hits the vertex exactly (no overshoot/truncation) and the geometric sticky mechanism are clean design choices that make generator consistency tractable. Treating both η>0 and η=0 in one framework, and transferring the construction to a convergent HJB scheme, fills a genuine gap relative to Euclidean semi-Lagrangian theory and to existing sticky-walk literature. Strengths include fully written Ethier–Kurtz arguments (with appendix proofs), an explicit discrete reflection estimate for the non-sticky case, and a standard but carefully adapted Barles–Souganidis argument at the vertex. Scope is limited to stars with constant per-edge σ (Remarks 3.6–3.7) and well-posedness/comparison are imported from [9] and an adaptation of [6]; within that scope the central claims are well supported.","major_comments":[{"comment":"Theorem 4.2 asserts comparison for bounded USC/LSC viscosity sub- and supersolutions on the unbounded network by a “straightforward adaptation” of [6]. The manuscript does not spell out which steps of [6] change under unbounded edges, linear growth of the Hamiltonian, or the sticky vertex operator K. Since uniqueness of the HJB limit (Theorem 4.6) rests entirely on this comparison, a short self-contained sketch (or a precise pointer to the modified doubling-variables/penalization argument) should be added so the reader can verify the adaptation covers the stated coefficient class (H1)–(H2) and the sticky condition.","section":"Section 4, Theorem 4.2"},{"comment":"For η=0, identification (Theorem 3.9) uses L² vanishing of the discrete occupation time O^h_T (display (3.21)) together with the bound |G^h φ(O)−Gφ(O)|≤C. The argument is correct under the stated core of C³_b test functions, but the passage from (3.25) to the martingale problem only controls the integrated discrepancy. It would strengthen the result to record explicitly that the same vanishing occupation time also yields the Kirchhoff condition in the limit (so the limit lies in D(G) rather than only solving the edge martingale problem). A one-paragraph clarification would remove any ambiguity about domain membership of the limit.","section":"Section 3.3, Theorem 3.9 and (3.21)–(3.25)"}],"minor_comments":[{"comment":"In (3.2) the residence probability uses √h/(η+√h); the calibration Remark 3.1 then gives expected occupation ηρ∑γ_κσ_κ+O(√h). A brief sentence linking this scaling to the continuous identity (2.5) would help readers unfamiliar with sticky local time.","section":"Section 3.1, Remark 3.1"},{"comment":"Figure 1 caption says η=0.35 while the panel label writes “= 0.7”; align caption and figure labels.","section":"Section 5.1, Figure 1"},{"comment":"The empirical slope ~0.64 for E_h (Figure 3) is reported without a theoretical rate. Stating that no rate is claimed (already partly done) and, if possible, noting the expected O(√h) consistency barrier from Lemma 3.5 would frame the numerics more clearly.","section":"Section 5.2"},{"comment":"Typos/notation: “ash→0” missing space (Thm 3.2); “Fully discretesemi-Lagrangian” (p.3); “recalibrated weights” vs later γ_ι without recalibration explanation; AMS class has a stray space in “49L25 ,”.","section":"Throughout"},{"comment":"References [2] and [6] are preprints; ensure arXiv identifiers remain stable or update if published before final version.","section":"References"}],"recommendation":"minor_revision","confidential_remarks":"Fit for a numerical-analysis / applied-probability journal is good. Novelty relative to Anagnostakis–Lejay–Villemonais and Bou-Rabee–Holmes-Cerfon is real but incremental; the HJB half is the main added value. No integrity concerns. The two major points are documentation/clarification, not structural flaws—minor_revision is appropriate."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The one thing worth knowing: they build an edge-adapted lattice with spacing σ_ι√h so the walk hits the vertex exactly, plus a geometric residence/re-emission at O that encodes stickiness. That gives weak convergence of the interpolated chain for both η>0 and η=0, and a fully discrete second-order SL scheme that converges to the viscosity solution of the network HJB.\n\nWhat is actually new is the combination, not the individual ingredients. Markov-chain approximation and SL for HJB are classical in R^d; first-order SL on networks and sticky network diffusions already exist. The contribution is the structure-preserving discretization that avoids overshoot/truncation, the separate tightness/identification arguments for the non-sticky case (vanishing occupation time + integrated consistency), and the transfer to a convergent controlled scheme. The Ethier–Kurtz work (Lyapunov, Aldous, uniform generator consistency for sticky, integrated for Kirchhoff) is written out cleanly with appendices. The HJB side is contraction + monotonicity + Barles–Souganidis with the right relaxed vertex operators. Numerics are qualitative only—occupation time, exit probabilities, value profiles, empirical slope ~0.64—but they match the theory they claim to illustrate.\n\nSoft spots are real but proportional and mostly flagged by the authors. Well-posedness of the continuous martingale problem and the comparison principle are imported ([9] and an adaptation of [6]); if those fail for the coefficient class, identification and uniqueness collapse. Scope is a star of half-lines with constant per-edge σ (finite graphs need commensurable intrinsic lengths; space-dependent σ is only sketched via intrinsic coordinates). No code. None of that overturns the internal argument under the stated hypotheses.\n\nThis is for people who actually discretize controlled diffusions or HJB on networks with junction delay. It is a methods paper that does what it says. I would send it to referees; it deserves a serious read, not a desk reject. I would cite the scheme if I needed a sticky-junction discretization in the next year.","headline":"Solid, usable Markov-chain + SL package for sticky/Kirchhoff network diffusions; novelty is the edge-adapted lattice and geometric residence, proofs are standard Ethier–Kurtz / Barles–Souganidis done carefully on a star.","tokens_in":24207,"tokens_out":532,"would_cite":true,"duration_ms":9630,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J60","49L25","49N80","65C30"],"pacs":[],"model":"grok-4.5","headline":"An edge-adapted Markov chain converges to sticky and Kirchhoff network diffusions and yields a convergent semi-Lagrangian scheme for network HJB equations.","keywords":["sticky diffusions","networks","Markov chain approximation","Hamilton–Jacobi–Bellman equations","semi-Lagrangian schemes","Kirchhoff conditions","viscosity solutions"],"falsifier":"On a three-edge star with known stickiness and weights, check whether the discrete occupation time at the vertex tends to zero like √h when stickiness is zero and stays positive and increasing with stickiness when it is positive, and whether empirical exit probabilities from a ball match the predicted redistribution weights; if either fails under grid refinement, the claimed weak convergence fails.","tokens_in":24227,"feed_emoji":"🔀","tokens_out":985,"duration_ms":16495,"temperature":0.7,"pith_summary":"Diffusions on networks need junction rules that either conserve flux (Kirchhoff) or hold the process at the vertex for a positive time (sticky). This paper builds a discrete Markov chain on a star network whose spatial steps are scaled to each edge's diffusion coefficient so that a downward step lands exactly on the vertex, with no overshoot or truncation. Stickiness is a geometric holding probability at the vertex, after which the chain is re-emitted along an edge with the right weights. The piecewise-constant interpolation of the chain is shown to converge in distribution, in the Skorokhod space, to the continuous sticky or non-sticky diffusion. The same transition mechanism produces a fully discrete semi-Lagrangian scheme for second-order Hamilton–Jacobi–Bellman equations on the network; the scheme converges locally uniformly to the unique bounded viscosity solution under both Kirchhoff and sticky vertex conditions. A sympathetic reader cares because the construction turns an abstract generator and transmission condition into a concrete, simulable random walk and a practical numerical method for controlled network dynamics with delays at junctions.","feed_headline":"Markov chain hits network vertices exactly, sticky or not","feed_subtitle":"Edge-adapted walk converges to sticky and Kirchhoff diffusions and yields a convergent HJB scheme","key_machinery":"The edge-adapted lattice with spacing σ_ι√h together with the geometric residence-and-re-emission rule at the vertex. Exact hitting of the vertex makes the discrete generator uniformly consistent in the sticky case and only integrably consistent (via vanishing occupation time) in the non-sticky case, so Ethier–Kurtz martingale-problem arguments close.","core_discovery":"The piecewise-constant interpolation of the edge-adapted Markov chain converges in distribution in the Skorokhod space to the sticky diffusion when the stickiness parameter is positive and to the non-sticky Walsh-type diffusion when it is zero; the associated fully discrete semi-Lagrangian scheme converges locally uniformly to the unique bounded viscosity solution of the network HJB equation under both junction regimes.","pith_inferences":["The exact-hit lattice idea should transfer to other singular boundaries (skew reflections, sticky points on intervals) where classical Euler–Maruyama needs artificial buffers.","Once a common time step exists, the same scheme can serve as a building block for mean-field games or control problems on larger networks with sticky hubs.","Empirical slope ~0.64 for the HJB error under refinement suggests a concrete rate question that the present consistency-plus-comparison argument does not yet answer."],"forward_implications":["Sticky and Kirchhoff network diffusions become simulable by a nearest-neighbour random walk with exact vertex hits and a simple geometric hold.","Second-order HJB equations on networks with either junction condition admit a monotone, fully discrete semi-Lagrangian scheme that converges to the viscosity solution.","When edge lengths divided by diffusion coefficients are commensurable, the same local construction extends to finite metric graphs.","Numerical experiments recover the predicted sticky occupation time, exit redistribution, and the approach of the vertex value toward the pure holding cost over the discount rate as stickiness grows."],"fun_headline_variants":["Markov chain converges to sticky network diffusions","Edge walk hits sticky and Kirchhoff vertices exactly","Discrete chain yields convergent HJB scheme on networks","Skorokhod limit links Markov chain to sticky diffusions","Semi-Lagrangian HJB scheme proven on sticky networks"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The continuous sticky generator's martingale problem is already well-posed and the network HJB equation already has a comparison principle; both facts are taken from earlier work rather than proved here, and the construction is limited to a star of half-lines with constant diffusion coefficient on each edge.","fun_headline_variants_meta":{"raw":{"variants":["Markov chain converges to sticky network diffusions","Edge walk hits sticky and Kirchhoff vertices exactly","Discrete chain yields convergent HJB scheme on networks","Skorokhod limit links Markov chain to sticky diffusions","Semi-Lagrangian HJB scheme proven on sticky networks"]},"model":"grok-4.5","effort":"low","cost_usd":0.004156,"raw_usage":{"total_tokens":1163,"prompt_tokens":651,"num_sources_used":0,"completion_tokens":62,"cost_in_usd_ticks":41564000,"prompt_tokens_details":{"text_tokens":651,"audio_tokens":0,"image_tokens":0,"cached_tokens":128},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":450,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":651,"tokens_out":62,"duration_ms":7765,"temperature":1.0,"reasoning_tokens":450,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-30T23:20:47.829456+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"On a three-edge star with known stickiness and weights, check whether the discrete occupation time at the vertex tends to zero like √h when stickiness is zero and stays positive and increasing with stickiness when it is positive, and whether empirical exit probabilities from a ball match the predicted redistribution weights; if either fails under grid refinement, the claimed weak convergence fails.","supporting_citations":[],"review_version":1}