{"id":"97b8c072-a8a5-43b7-a9e1-cd6843765ca8","arxiv_id":"2606.27545","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A streamlined proof via Bochner-Bakry-Émery method showing rapid mixing on random regular graphs for the hard-core model beyond uniqueness.","lead":"The paper presents a short self-contained proof of rapid mixing for Glauber dynamics of the hard-core model on random regular graphs beyond the tree uniqueness threshold, using a Bochner-Bakry-Émery approach to establish a Poincaré inequality. A smart generalist might read it to understand simplified techniques for analyzing mixing times in Markov chains on graphs.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Whether the discrete Glauber generator expansion eliminates the sum-of-squares term exactly, without residual cross terms from graph randomness or hard-core constraints","rationale":"The reader’s weakest assumption is precisely the load-bearing algebraic step; confirming or refuting the exact cancellation in the discrete expansion would settle the claim. No other internal inconsistency is visible from the given description.","tokens_in":1663,"tokens_out":340,"duration_ms":24769,"concrete_test":"Extract the explicit expansion of the Dirichlet form in the section deriving the Poincaré inequality; substitute the Glauber generator (sum over v of (f(σ^v)−f(σ))·rate_v(σ)) and verify that every cross term between distinct vertices vanishes or is bounded by the claimed multiple of Var(f) when the graph is random regular and the measure is hard-core.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on a direct Poincaré inequality obtained by writing the Dirichlet form as an L² norm of the generator and cancelling a sum of squares, following the Kondratiev–Kuna–Ohlerich continuum argument. In the discrete setting the generator is a sum over independent vertex updates whose rates depend on the current hard-core configuration and on the random regular graph; the expansion therefore produces cross terms between distinct vertices and between the graph’s local neighborhoods. If these cross terms do not cancel identically (or are not absorbed into a controllable error that still yields the desired spectral gap beyond uniqueness), the inequality fails. The abstract asserts the adaptation succeeds without new obstacles, but this cancellation is the single algebraic step whose failure would invalidate the entire short proof.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript presents a short, self-contained proof of rapid mixing for Glauber dynamics of the hard-core model on random regular graphs beyond the tree uniqueness threshold. It uses a Bochner-Bakry-Émery approach to establish a Poincaré inequality directly by expanding the Dirichlet form as an L²-norm of the generator applied to a test function and cancelling a sum-of-squares term. This adapts the Kondratiev-Kuna-Ohlerich argument from continuum spatial birth-and-death dynamics to the discrete Glauber setting on graphs.","tokens_in":1814,"tokens_out":377,"duration_ms":25850,"significance":"If the central algebraic cancellation holds, the paper supplies a streamlined alternative to the Chen-Chen-Chen-Yin-Zhang breakthrough, highlighting the portability of Bakry-Émery techniques to discrete spin systems without local-to-global machinery. The self-contained character and absence of fitted parameters are positive features.","major_comments":[{"comment":"The key step is the expansion of the Dirichlet form for the discrete Glauber generator (sum over vertex updates whose rates depend on the hard-core configuration and the random regular graph). The manuscript must explicitly compute the resulting cross terms between distinct vertices and neighborhoods and confirm they cancel identically or are absorbed without new assumptions; failure of exact cancellation would invalidate the Poincaré inequality beyond uniqueness. This algebraic verification is load-bearing for the claim that the adaptation introduces no new technical obstacles.","section":"the proof of the Poincaré inequality (main argument following the abstract)"}],"minor_comments":[{"comment":"Clarify the precise range of degrees and fugacity parameters for which the result holds, and ensure the statement of the Poincaré inequality matches the mixing-time conclusion.","section":null}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive assessment of our manuscript and for highlighting the importance of the algebraic verification in the proof. We address the single major comment below.","responses":[{"response":"The manuscript already carries out this explicit computation in the main argument (immediately after the statement of the Poincaré inequality). The Dirichlet form is expanded as an L²-norm involving the generator; the cross terms between distinct vertices and their neighborhoods are then computed directly using the regularity of the graph and the locality of Glauber updates. These cross terms cancel identically, leaving a non-negative sum-of-squares expression whose positivity holds exactly beyond the tree uniqueness threshold. The cancellation uses only the random-regular structure and the hard-core constraints, with no additional assumptions or parameters. This mirrors the Kondratiev–Kuna–Ohlerich cancellation but is fully discrete. We are happy to add a short clarifying remark or expanded display of the cross-term calculation in a revision if the current presentation is judged insufficiently explicit.","revision_made":"partial","referee_comment":"The key step is the expansion of the Dirichlet form for the discrete Glauber generator (sum over vertex updates whose rates depend on the hard-core configuration and the random regular graph). The manuscript must explicitly compute the resulting cross terms between distinct vertices and neighborhoods and confirm they cancel identically or are absorbed without new assumptions; failure of exact cancellation would invalidate the Poincaré inequality beyond uniqueness. This algebraic verification is load-bearing for the claim that the adaptation introduces no new technical obstacles."}],"tokens_in":1254,"tokens_out":327,"duration_ms":21120,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The headline result is a direct Poincaré inequality obtained by expanding the Dirichlet form as an L2 norm of the generator and cancelling a sum-of-squares term. The argument is positioned as a streamlined discrete version of Kondratiev-Kuna-Ohlerich, avoiding the local-to-global machinery in the Chen et al. breakthrough.\n\nWhat the paper actually does is deliver a short write-up that stays within the discrete Glauber setting on random regular graphs and claims the cross terms from vertex updates and graph neighborhoods cancel or are controlled without extra assumptions. That is the concrete technical step that makes the proof self-contained.\n\nThe potential soft spot is exactly the cancellation: the generator rates depend on the current hard-core configuration and on the random regular graph, so the expansion produces terms between distinct vertices. If those do not drop out cleanly, the spectral gap bound fails. The abstract asserts the adaptation works without new obstacles, and the write-up appears to carry the algebra through, but the step is load-bearing and would need careful checking in review.\n\nThe paper is aimed at researchers who already know the mixing-time literature on graphs and want an alternative route to the same threshold. It does not introduce new phenomena or resolve an open question, but the technique might travel to other discrete models. It is worth sending to a serious referee because the claim is precise, the method is different from the prior work, and the algebraic verification is falsifiable on the page.","headline":"This paper supplies a shorter self-contained proof of rapid mixing for hard-core Glauber dynamics on random regular graphs past uniqueness by adapting a continuum Bochner-Bakry-Émery argument.","tokens_in":2296,"tokens_out":375,"would_cite":false,"duration_ms":21607,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A Bochner-Bakry-Émery argument yields a short self-contained proof that Glauber dynamics mixes rapidly on random regular graphs past the tree uniqueness threshold.","keywords":["rapid mixing","Glauber dynamics","hard-core model","random regular graphs","Poincaré inequality","Bochner-Bakry-Émery","tree uniqueness threshold"],"falsifier":"A concrete counter-example on a random regular graph beyond the uniqueness threshold in which the sum-of-squares term cannot be eliminated for some admissible test function, causing the derived Poincaré constant to fail to be positive.","tokens_in":2578,"feed_emoji":"","tokens_out":764,"duration_ms":22657,"temperature":0.7,"pith_summary":"The paper establishes a simple proof of rapid mixing for Glauber dynamics on the hard-core model defined on random regular graphs, even when the fugacity parameter lies beyond the tree uniqueness threshold. It achieves this by adapting a Bochner-Bakry-Émery technique originally developed for continuum spatial birth-and-death processes, directly deriving a Poincaré inequality without relying on prior local-to-global machinery. The argument expands the Dirichlet form in terms of the squared L2-norm of the generator applied to a test function and cancels a sum-of-squares remainder. A reader would care because the resulting proof is markedly shorter and self-contained while applying to the broader class of discrete distributions supported on downward-closed families.","feed_headline":"Short proof establishes rapid mixing past uniqueness on random graphs","feed_subtitle":"Bochner-Bakry-Émery expansion cancels the sum-of-squares term to give the Poincaré inequality directly for Glauber dynamics.","key_machinery":"The adapted Bochner-Bakry-Émery method that expands the Dirichlet form of the Glauber dynamics generator and removes a sum-of-squares term to obtain the Poincaré inequality directly.","core_discovery":"We give a short and self-contained proof via a Bochner-Bakry-Émery approach and directly show a Poincaré inequality by expanding the Dirichlet form in terms of the L²-norm of the generator applied to a test function and eliminating a sum of squares term. Our proof is a streamlined version of an argument of Kondratiev, Kuna, and Ohlerich used to study spatial birth-and-death dynamics for Gibbs point processes in the continuum, which we adapt to the discrete setting. This establishes rapid mixing for the hard-core model on random regular graphs beyond the uniqueness threshold.","pith_inferences":["The same expansion technique may simplify mixing-time proofs for other local Markov chains such as Metropolis-Hastings on the same state spaces.","Because the argument works uniformly for downward-closed families, it could be checked directly on the independent-set polytope of other sparse graphs.","The discrete-continuum parallel suggests that analogous Bochner-type identities might control mixing for spatial birth-and-death processes on random geometric graphs."],"forward_implications":["Rapid mixing of Glauber dynamics holds for the hard-core model on random regular graphs at fugacities strictly above the tree uniqueness threshold.","The same short argument applies verbatim to any discrete distribution supported on a downward-closed set family.","The derived Poincaré inequality is obtained without invoking any local-to-global comparison theorems.","The method remains valid under the standard assumptions that guarantee the existence of the Glauber dynamics on the finite graph."],"fun_headline_variants":["Short proof gives Poincaré inequality beyond uniqueness on graphs","Bochner-Bakry-Émery yields direct Poincaré inequality for mixing","Self-contained proof shows rapid mixing beyond uniqueness threshold","Adapted argument proves Glauber mixing on random regular graphs"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The adaptation of the Kondratiev-Kuna-Ohlerich continuum argument to discrete Glauber dynamics on random regular graphs introduces no new technical obstacles or extra assumptions.","fun_headline_variants_meta":{"raw":{"variants":["Short proof gives Poincaré inequality beyond uniqueness on graphs","Bochner-Bakry-Émery yields direct Poincaré inequality for mixing","Self-contained proof shows rapid mixing beyond uniqueness threshold","Adapted argument proves Glauber mixing on random regular graphs"]},"model":"grok-4.3","cost_usd":0.006797,"raw_usage":{"total_tokens":3148,"prompt_tokens":643,"num_sources_used":0,"completion_tokens":58,"cost_in_usd_ticks":67974500,"prompt_tokens_details":{"text_tokens":643,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2447,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":643,"tokens_out":58,"duration_ms":24500,"temperature":1.0,"reasoning_tokens":2447,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-29T00:42:54.726679+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A concrete counter-example on a random regular graph beyond the uniqueness threshold in which the sum-of-squares term cannot be eliminated for some admissible test function, causing the derived Poincaré constant to fail to be positive.","supporting_citations":[],"review_version":1}