{"id":"b7fbc2f7-0926-4f0e-9f25-c38f0e1b87c7","arxiv_id":"2606.13264","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A symmetric N-queue wireless network is stable exactly when the arrival rate is below the worst-case interference service rate, and a replica mean-field limit gives explicit geometric stationary distributions.","lead":"A new math model studies wireless networks where transmitters only send when they have data, so interference drops when idle neighbors stop transmitting. It proves the exact traffic load a symmetric network can handle and gives fast formulas for delay and congestion.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Performance claims rest on an unquantified approximation: Theorems 3.13–3.14 show K-replica → MF1 as K→∞, but the original network is K=1; no error bound or reproducible numerics bridges this gap.","rationale":"I read the stability proof and the replica mean-field proofs as internally consistent. The weakest point is not mathematical correctness but the inferential leap from MF1/MF2 to the original finite-N system. The authors explicitly disclaim a rigorous link and list the error bound as open, so the paper does not overclaim; however, the abstract and introduction motivate the model for performance evaluation, making this gap load-bearing. The reader's conditional verdict captures exactly this. I therefore agree and recommend no change.","tokens_in":26372,"tokens_out":11459,"duration_ms":121527,"concrete_test":"Independently compute the exact stationary distribution of the original N=5 Markov chain (generator (2)) by truncating queue lengths at a large K (e.g., 100–200) and solving the linear system, or by Monte Carlo with confidence intervals; compare mean queue length, mean delay, variance, and busy probability to the MF1 geometric formula of Theorem 3.16 and to the MF2 fixed point (11) for the same parameters (B=10, l=1/r^2, λ in {0.5,1,1.5,2,2.4}·μ*). If the relative error in mean delay exceeds, say, 5% away from the boundary, or if the busy probability ordering of Conjecture 3.27 fails, the approximation's practical validity is not established. Publish code and raw data.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central performance-evaluation claim—that MF1 and MF2 provide accurate approximations for the finite-N interference queueing network—rests on the unproven closeness of the original system to the replica mean-field limit. Theorems 3.13–3.14 prove convergence of the K-replica system (Definition 3.8) to the McKean–Vlasov system (7) as K→∞. But the original network is exactly the K=1 replica system; convergence as K→∞ provides no quantitative error estimate at K=1. The only direct evidence is Section 3.2.3, a Monte Carlo comparison with no code, no confidence intervals, and N=5. The paper explicitly acknowledges this gap: Section 3.2.1 says 'one should not expect immediate quantitative or qualitative bounds between the original system and the limiting system,' and Section 5.2 lists 'quantitative error bounds between the true system and the proposed mean-field approximations' as an open problem. Because the stated goal is performance evaluation (Section 1.1), and the tractable formulas (Theorem 3.16) are for MF1, not for the true system, the practical conclusions are conditional on this approximation being accurate. If the gap is large—e.g., near λ→μ*, for larger N, or for busy probability as Figure 8 suggests—delay/congestion predictions could be materially wrong even though Theorem 3.1 and the mean-field analysis are correct.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a symmetric wireless network of N queues on a torus, where each queue's service rate is the Shannon capacity determined by the SINR, which depends on whether neighboring queues are empty. The main results are: (i) Theorem 3.1 establishes that the stability region is exactly λ < μ*, where μ* is the full-buffer worst-case service rate; (ii) a replica mean-field construction (Definition 3.8) is proved to satisfy propagation of chaos toward a McKean–Vlasov limit (Theorems 3.13–3.14), whose stationary distribution is explicitly geometric with parameter solving the scalar fixed point λ/x = B log2(1 + 1/(1+xξ_N)) (Theorem 3.16); (iii) a second mean-field approximation (MF2) is introduced with stochastic ordering comparisons (Propositions 3.23, 3.25, 3.26); (iv) exponential convergence to stationarity is proved for the true system and the mean-field models (Theorems 3.29–3.30); and (v) approximate formulas are proposed for random transmitter spacings (Proposition 3.33). The proofs use couplings with independent M/M/1 queues, monotonicity, fixed-point arguments, and Lyapunov methods.","tokens_in":26722,"tokens_out":12508,"duration_ms":126553,"significance":"If the results stand, the paper gives a clean characterization of the stability region for a bursty-traffic interference queueing network, showing that empty slots do not enlarge the stability region, and it provides fully tractable stationary formulas for the replica mean-field model, with an explicit product-form geometric distribution. The replica mean-field construction is an interesting and nontrivial variant of classical mean-field limits, and the exponential convergence result for the finite-N interacting system is useful. However, the paper's performance-evaluation claims for the original finite-N network are not supported by the central theorems: propagation of chaos is proved only for the artificial K-replica system as K→∞, and no quantitative bound connects this to the original system (K=1). The numerical comparison in Section 3.2.3 has no code, no confidence intervals, and only N=5. The paper itself acknowledges this gap in Sections 3.2.1 and 5.2, but the abstract and Section 3.2.3 present the approximations as accurate for the true system. The random-spacing extension (Section 3.4) also contains apparent sign and formula inconsistencies. Thus the rigorous contribution","major_comments":[{"comment":"The performance-evaluation conclusions are load-bearing but not supported by the theorems. Theorems 3.13–3.14 prove convergence of the K-replica system to MF1 as K→∞, while the original network is exactly K=1; no finite-K or finite-N error bound is given. The paper explicitly states in Section 3.2.1 that 'one should not expect immediate quantitative or qualitative bounds between the original system and the limiting system' and lists this as an open problem in Section 5.2. In light of this, the abstract's claim that the mean-field provides 'approximations of its stationary distribution' and Section 3.2.3's statement that MF1 'performs best' for delay are stronger than what the mathematics establishes. I recommend either (a) reframing the contributions as exact results for two new tractable mean-field models, with the relation to the original system explicitly conjectural, or (b) adding a","section":"§3.2.1, §3.2.3, §5.2"},{"comment":"The random-spacing formulas appear internally inconsistent. Lemma 4.13 gives E_MF[q|S=s] = λ/(B/ln(2) − λ(1 + N(N−1)/(2s^α))) + ε, but Proposition 3.33 uses a denominator B/ln(2) − λu with u = J/s^α and omits the '+1' term, and uses J = Σ_{j=1}^{N−1} j^{−α} rather than a periodic interference sum appropriate to the torus. Additionally, the first line of Eq. (16) has a sign error: after the change of variables u = J/s^α the prefactor should be positive, not negative, which propagates through the integration-by-parts expression. Because these closed-form approximations are presented as part of the main results, they need to be corrected or removed. As written, they undermine the random-spacing extension.","section":"§3.4, Lemmas 4.12–4.13, Proposition 3.33"},{"comment":"The uniqueness proof for the fixed point of Eq. (8) is incomplete. The derivative f'(x) has the sign of the quadratic A(x). The proof shows the first root x1 < 0, but A has a second root x2 > 0, so f is not monotone on (0,1); it decreases then increases. The conclusion of uniqueness is nevertheless true because f(1) = λ − μ* < 0, so the function can cross zero only once, but this needs to be stated. Please complete the argument by showing f(x2) < 0 or x2 > 1. This gap is load-bearing for Theorem 3.16, which depends on the uniqueness of x*.","section":"Lemma 3.15 (proof)"}],"minor_comments":[{"comment":"The numerical comparison has no code, no confidence intervals, and only N=5. Figure 8 suggests disagreement for busy probability away from the stability boundary. Since the paper relies on this section to support the approximation's practical value, please include error bars or explicitly label the plots as illustrative with no statistical claim.","section":"§3.2.3"},{"comment":"The sentence 'The Lyapunov function introduced below was obtained with the assistance of an AI tool (ChatGPT Thinking 5.2)' should be verified against the journal's policy on AI-assisted proofs. The proof itself is present, but please clarify the verification process and whether any of the AI-generated text was used verbatim.","section":"§4.3"},{"comment":"Minor notation issues: in Remark 3.22 the fixed-point equation (11) would be clearer if the support values w_j^k were defined with explicit dependence on p; in Eq. (34) the symmetry reduction from the N-queue sum to a single queue should be stated explicitly; the reference to 'Section A' in Remark 2.4 should point to the Appendix with the correct numbering. These do not affect the mathematics.","section":"Various"}],"recommendation":"major_revision","confidential_remarks":"The paper is honest about its main limitation (no quantitative link between the original network and the replica mean-field), but the framing and the numerical section nonetheless overstate the approximation's validated accuracy. The random-spacing section seems less carefully checked than the rest of the paper; the sign and formula issues there should be fixed before publication. There is also heavy self-citation of the senior author's prior work; most citations are relevant, but a few (e.g., [24] for a stability result) could be streamlined."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The stability region theorem is the real result here, and it holds up on reading. For the symmetric N-queue torus with Shannon-rate service, the exact threshold is lambda < mu* for positive recurrence and lambda > mu* for transience. The proof is more elegant than the abstract suggests: before the boundary is hit, the true system and the full-buffer system coincide, so transience reduces to N independent M/M/1 queues. That is a genuinely new and citable result.\n\nWhat the paper does well beyond that: the replica mean-field construction is a faithful adaptation of the neural-network replica method to queueing, and the propagation-of-chaos proofs (Theorems 3.13–3.14) are standard Sznitman-type coupling done competently. The McKean–Vlasov stationary distribution is surprisingly tractable: product of geometrics with parameter given by the scalar fixed point lambda/x = B log2(1 + 1/(1+x xi_N)). The exponential convergence to stationarity for the true system, using domination by the full-buffer process and a return-time argument, is also a solid contribution. The paper discloses that one Lyapunov function was found with AI assistance — that is honest and not a problem.\n\nThe soft spot is real and the authors already know it. The original network is exactly the K=1 replica system, and the propagation-of-chaos theorem only gives convergence as K goes to infinity. There is no quantitative bound at K=1, and the paper says so explicitly (Section 3.2.1) and lists the error bound as an open problem (Section 5.2). So it is not an overclaim — but it means the delay and congestion predictions are conditional on an unquantified approximation. The only supporting evidence is the numerical section, and that is thin: N=5, no code or data, no error bars, and Monte Carlo runs up to 10^5 may be short near the critical load. A second minor issue: uniqueness of the MF2 fixed point is only asserted numerically; existence is proved, uniqueness is not. The uniqueness proof of Lemma 3.15 is also terse — the derivative argument is probably fine, but it deserves a careful read.\n\nReferences are appropriate; there is heavy self-citation, but the new results do not depend on it. This is a paper for people working on mean-field limits of interacting queues or wireless performance beyond the full-buffer assumption. It deserves a serious referee. The main revision request should be reproducible numerics and a sharper statement of what the approximations do and do not claim.\n\nRecommendation: send to peer review; the core theorems are likely correct, but the practical claims need tempering or better evidence.","headline":"Solid stability theorem with an honest but unquantified mean-field gap; worth serious peer review.","tokens_in":27191,"tokens_out":3321,"would_cite":true,"duration_ms":38081,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K25","60F05","60K35"],"pacs":[],"model":"deepseek-v4-flash","headline":"For a symmetric wireless network of queues, the paper proves the stability threshold is exactly the worst-case full-buffer service rate, and it supplies tractable mean-field formulas for delay and congestion in the stable regime.","keywords":["interference queueing networks","stability region","mean-field approximation","propagation of chaos","McKean–Vlasov","Shannon capacity","queueing theory","wireless networks"],"falsifier":"For a fixed moderate N (say N=5) and path-loss ℓ1, simulate the true stationary mean queue length via Monte Carlo for several λ well below μ* and compare to the MF1 geometric prediction; if the relative error is not consistently small (e.g., grows as λ→μ* or exceeds the ~10^-2 reported in Figure 6), the claim that MF1 is a tractable accurate proxy fails. Also, at λ=μ* for N=3, check whether the chain is positive recurrent; a positive-recurrent finding would contradict the asserted stability-region threshold, since the boundary case is left open in the paper.","tokens_in":26271,"feed_emoji":"📡","tokens_out":4980,"duration_ms":56866,"temperature":0.7,"pith_summary":"The paper studies N transmitter–receiver pairs on a torus, each with a queue of files, where the service rate is the Shannon capacity determined by how many neighboring transmitters are currently active. It proves that the network is stable (positive recurrent) exactly when the arrival rate λ is below μ*, the rate a queue would get if every neighbor were active; above μ* the process is transient. Empty queues therefore do not enlarge the stability region. For the stable regime, the paper introduces two mean-field approximations: one obtained as the limit of a K-replica system (with propagation of chaos proved), the other as a queue in an autonomous random environment. The first has an explicit stationary distribution—a product of geometric laws parameterized by the solution of the scalar fixed-point equation λ/x = B log2(1 + 1/(1 + x ξ_N))—making congestion and delay directly computable. The true system and both approximations converge exponentially fast to stationarity.","feed_headline":"Interference queues are stable exactly below the full-active rate","feed_subtitle":"A replica mean-field limit yields explicit geometric stationary distributions for delay and congestion.","key_machinery":"The replica mean-field construction (Definition 3.8): a system of K identical replicas of the N-queue network, where each queue's departure rate is the average over replicas of the interference from neighboring non-empty queues. Propagation of chaos (Theorems 3.13–3.14) identifies the K→∞ limit as a McKean–Vlasov queue whose stationary distribution has the geometric product form; the scalar fixed-point equation λ/x = B log2(1 + 1/(1 + x ξ_N)) carries the parameterization of that distribution. The SDE representation with Poisson random measures is the coupling tool used to prove propagation of chaos and the stability threshold.","core_discovery":"The central discovery is the exact stability region: for λ > μ*, the queueing network is transient, while for λ < μ* it is positive recurrent (Theorem 3.1). The proof couples the true system with N independent M/M/1 queues at the worst-case service rate μ* (the full-buffer system); before any queue empties, the two coincide, and transience above μ* follows from the independent queues' transience. In the stable regime, the replica mean-field limit (a McKean–Vlasov queue built from K replicas) has a unique stationary distribution that is a product of geometric marginals with parameter x*(λ), the unique solution of λ/x = B log2(1 + 1/(1 + x ξ_N)) (Theorem 3.16). This makes the stationary law of","pith_inferences":["The replica mean-field limit remains a stochastic McKean–Vlasov equation rather than the usual deterministic ODE mean-field; this may transfer more faithfully to small-N networks, but it also means the limit does not arise directly from letting N→∞ in the original system, so the approximation's accuracy for large N is not implied by propagation of chaos.","Quantitative error bounds between the original chain and either mean-field limit are absent (listed as an open problem in Section 5.2); until such bounds exist, the reported ~10^-2 relative error for MF1 should be read as a case study, not a guarantee.","The boundary case λ = μ* remains open for N > 2; if the chain turned out to be positive recurrent at the boundary in some geometries, the asserted 'exact' stability-region threshold would require qualification.","The geometry-preserving replica construction suggests a template for mean-field limits of other interacting queueing systems with state-dependent service rates; the same fixed-point strategy could be applied to nearest-neighbor or heterogeneous networks."],"forward_implications":["Network dimensioning can use μ* as the exact admissible-load threshold under bursty traffic; the full-buffer worst-case region is not enlarged by exploiting empty slots.","Mean-field 1 gives an explicit M/M/1-type approximation for stationary mean queue length and delay via a scalar fixed-point equation, with geometric marginals.","Exponential convergence to stationarity (for the true system and both approximations) justifies using finite-horizon simulations to estimate steady-state performance.","The two mean-field approximations provide a conjectured sandwich for the true busy probability: MF2 under-estimates and MF1 over-estimates it.","For random transmitter positions, closed-form approximations for expected queue length and delay can be obtained under power-law path loss by averaging the fixed-point equation."],"fun_headline_variants":["Exact stability cutoff for interference queues","Interference queues stable precisely below full-buffer rate","Replica mean-field yields exact stability and geometric law","Interference queues: geometric law from replica mean-field","Stability of interference queues: exact threshold found"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The performance conclusions (delay, congestion, busy probability) rely on the assumption that the mean-field approximations accurately represent the original finite-N interacting queueing system; the paper proves propagation of chaos only for the artificial K-replica system and establishes no quantitative bound between the original N-queue network and either mean-field limit, so if this approximation fails for realistic parameters, the delay/congestion predictions would be un","fun_headline_variants_meta":{"raw":{"variants":["Exact stability cutoff for interference queues","Interference queues stable precisely below full-buffer rate","Replica mean-field yields exact stability and geometric law","Interference queues: geometric law from replica mean-field","Stability of interference queues: exact threshold found"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000434,"raw_usage":{"total_tokens":2051,"prompt_tokens":752,"completion_tokens":1299,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":496,"completion_tokens_details":{"reasoning_tokens":1227}},"tokens_in":496,"tokens_out":1299,"duration_ms":10383,"temperature":1.0,"reasoning_tokens":1227,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T11:38:05.036043+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a fixed moderate N (say N=5) and path-loss ℓ1, simulate the true stationary mean queue length via Monte Carlo for several λ well below μ* and compare to the MF1 geometric prediction; if the relative error is not consistently small (e.g., grows as λ→μ* or exceeds the ~10^-2 reported in Figure 6), the claim that MF1 is a tractable accurate proxy fails. Also, at λ=μ* for N=3, check whether the chain is positive recurrent; a positive-recurrent finding would contradict the asserted stability-region threshold, since the boundary case is left open in the paper.","supporting_citations":[],"review_version":2}