{"id":"c09672bc-1295-4966-90c1-649b0f1c3746","arxiv_id":"2606.11271","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"The K-th nearest neighbor random walk on a homogeneous Poisson point process visits finitely many points if and only if K has bounded support, with exponential decay in visits and path length, plus a polynomial-tail counterexample.","lead":"The paper proves that a K-th nearest neighbor random walk on a Poisson point process in R^d visits only finitely many points, with exponential decay, precisely when the distribution of K has bounded support. This clarifies trapping conditions for random walks in random media.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Independence of PPP increments may fail to hold for the random unexplored regions after pioneer points, as regions depend on the configuration and labels.","rationale":"The reader's weakest_assumption directly identifies the same potential failure point in the argument for Theorem 1. Because the full proof is not supplied, the concern remains open but is load-bearing for the exponential decay claim; verifying the conditional law would settle it.","tokens_in":1759,"tokens_out":308,"duration_ms":15809,"concrete_test":"Fix a finite configuration of pioneer points and labels up to the first pioneer; compute the conditional intensity or void probability P(no points in a test ball B in the unexplored complement | pioneers) and check whether it equals the unconditional exp(-|B|) law of the original PPP.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Theorem 1 claims exponential decay on the number of visited points under (BS) by controlling the unexplored space via pioneer points. This control uses that the PPP has independent increments in disjoint regions. However, pioneer points are stopping sets whose locations and the resulting unexplored complement are random and measurable w.r.t. the joint law of χ and the i.i.d. labels; the conditional law of χ on the complement given the pioneers need not remain homogeneous Poisson (void probabilities can be altered by the selection bias). If this conditional law deviates, the renewal-type argument for exponential tails on the number of pioneers (hence on visited points) does not go through.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper studies the K-th nearest neighbor random walk on a homogeneous Poisson point process χ on R^d, where the next point is selected among the K closest neighbors according to i.i.d. labels distributed as K. Theorem 1 asserts that the number of visited points has exponentially decaying tails whenever K has bounded support (BS), and that the walk visits only finitely many points a.s. if and only if (BS) holds; the proof introduces the auxiliary notion of pioneer points to control the explored region. Theorem 2 claims exponential decay of the Euclidean trajectory length under (BS). Theorem 3 exhibits a bounded-support label distribution for which the number of steps until a new point is discovered has at least polynomial tails.","tokens_in":1894,"tokens_out":441,"duration_ms":17346,"significance":"If the claims are correct, the results give precise trapping criteria for nearest-neighbor walks on PPPs and introduce pioneer points as a tool for handling explored regions in point-process settings. The distinction drawn in Theorem 3 between finite visits and polynomial discovery times is a useful clarification of the geometry of the process.","major_comments":[{"comment":"Proof of Theorem 1 (pioneer-point construction and renewal argument): the argument controls the unexplored complement via independent increments of the homogeneous PPP, but pioneer points are defined as a stopping set measurable with respect to the joint law of χ and the labels. The conditional law of χ on the random complement need not remain homogeneous Poisson (void probabilities can be biased by the selection of pioneers), so the exponential-tail renewal estimate does not follow directly from the unconditional PPP property.","section":"Theorem 1 and pioneer-point section"},{"comment":"Abstract and Theorem 1 statement: the three main theorems are asserted without any displayed proof steps, error bounds, or explicit verification that the pioneer-point construction preserves the required conditional independence; this makes the central claims rest on an unverified auxiliary object whose correctness cannot be checked from the given text.","section":"Abstract / Theorem 1"}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their thorough review and valuable feedback on our manuscript. We respond to the major comments point by point below.","responses":[{"response":"We are grateful for this insightful comment highlighting a potential subtlety in the conditional distribution. The key point is that although the pioneer set is a stopping set depending on both χ and the labels, the labels are assigned independently of the point locations. Consequently, the event that a particular region remains unexplored is determined solely by the absence of points in certain areas and the walk's path, but the independence ensures that the void probabilities in the complement are not biased. The renewal argument relies on restarting the process in the unexplored region, which remains Poisson due to the spatial homogeneity and independence from labels. To make this rigorous, we will add an auxiliary result (new Lemma 3.2) that explicitly computes the conditional intensity and confirms it is unchanged. This addresses the concern directly.","revision_made":"yes","referee_comment":"[Theorem 1 and pioneer-point section] Proof of Theorem 1 (pioneer-point construction and renewal argument): the argument controls the unexplored complement via independent increments of the homogeneous PPP, but pioneer points are defined as a stopping set measurable with respect to the joint law of χ and the labels. The conditional law of χ on the random complement need not remain homogeneous Poisson (void probabilities can be biased by the selection of pioneers), so the exponential-tail renewal estimate does not follow directly from the unconditional PPP property."},{"response":"The abstract is a concise summary and conventionally omits detailed proof steps. For Theorem 1, the statement is followed by the proof in Section 3, but we acknowledge that the verification of the pioneer-point properties could be more prominently displayed. In the revised manuscript, we will insert a brief outline of the proof strategy right after the theorem statement, including references to the lemmas verifying conditional independence and the exponential bounds. This will allow readers to check the logic without reading the entire section. No changes to the abstract itself are planned, as it accurately reflects the results.","revision_made":"partial","referee_comment":"[Abstract / Theorem 1] Abstract and Theorem 1 statement: the three main theorems are asserted without any displayed proof steps, error bounds, or explicit verification that the pioneer-point construction preserves the required conditional independence; this makes the central claims rest on an unverified auxiliary object whose correctness cannot be checked from the given text."}],"tokens_in":1465,"tokens_out":502,"duration_ms":32921,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core claim is that the K-th nearest neighbor walk on a homogeneous Poisson point process visits finitely many points exactly when K has bounded support. They get exponential decay on the number of visited points (and on path length) under that assumption, and they exhibit a bounded-support label distribution where the waiting time for new points has at least polynomial tails. The pioneer-point construction is the main new device; it marks the frontier of explored space so the walk can be renewed on the remaining region.\n\nThat characterization and the counterexample are the real contributions. The iff statement is clean and the polynomial-tail example is useful because it separates finite visits from rapid trapping. Both look like genuine extensions beyond standard nearest-neighbor recurrence results.\n\nThe soft spot is the independence argument after pioneers. The stress-test note is right to flag that pioneer points are stopping sets whose locations depend on the joint configuration and labels, so the conditional law on the complement might not stay homogeneous Poisson. If the paper only invokes the usual independent-increments property without checking the selection bias, the exponential-tail proof has a gap. The abstract does not show the fix, so that step needs verification in the full text.\n\nThis is for people in stochastic geometry or random walks on point processes. It is worth sending to a serious referee: the question is natural, the results are sharp, and the technique is worth testing even if one technical point requires work.","headline":"The paper gives a sharp iff for trapping of these K-NN walks on PPP using pioneer points, plus a clean counterexample on tails, but the conditional Poisson step needs a close look.","tokens_in":2398,"tokens_out":369,"would_cite":false,"duration_ms":14892,"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":"The K-th nearest neighbor random walk on a Poisson point process visits finitely many points if and only if K has bounded support.","keywords":["nearest neighbor random walk","Poisson point process","trapping","exponential decay","pioneer points","bounded support"],"falsifier":"A single explicit construction of a bounded-support K and a Poisson realization on which the walk visits infinitely many points with positive probability would disprove the main claim.","tokens_in":2696,"feed_emoji":"","tokens_out":458,"duration_ms":21528,"temperature":0.7,"pith_summary":"The paper proves that when the random variable K has bounded support, the number of Poisson points visited by the walk decays exponentially, so the walk gets trapped after finitely many steps. This characterization matters because it identifies exactly when the walk remains local rather than exploring the infinite point set. The argument introduces pioneer points to mark the frontier of already-visited regions and exploit the spatial independence of the Poisson process. The same bounded-support condition also yields exponential decay for the Euclidean length of the trajectory. The authors further exhibit a bounded-support example in which the waiting time for new discoveries has only a polynomial tail.","feed_headline":"K-nearest neighbor walk traps after finite visits when K bounded","feed_subtitle":"The walk visits finitely many Poisson points exactly when the selection variable K has bounded support, yielding exponential decay in both c","key_machinery":"The notion of pioneer point, which isolates the boundary between explored and unexplored space so that the independence of the Poisson process can be applied to the remaining region.","core_discovery":"The number of Poisson points visited by the K-th nearest neighbor random walk admits an exponential decay whenever K has bounded support. In particular the walk visits finitely many points if and only if K satisfies the bounded-support assumption. Under the same assumption the Euclidean length of the trajectory also decays exponentially. There exists a bounded-support distribution for which the number of steps until a new point is discovered has at least a polynomial tail.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["K-nearest neighbor walk traps on Poisson points with bounded K","Finite Poisson visits for K-NN walk when K has bounded support","K-NN random walk on Poisson gets trapped under bounded K support","Poisson point process traps Kth nearest neighbor walk for bounded K"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The underlying point process is a homogeneous Poisson point process, so that points in disjoint regions are independent.","fun_headline_variants_meta":{"raw":{"variants":["K-nearest neighbor walk traps on Poisson points with bounded K","Finite Poisson visits for K-NN walk when K has bounded support","K-NN random walk on Poisson gets trapped under bounded K support","Poisson point process traps Kth nearest neighbor walk for bounded K"]},"model":"grok-4.3","cost_usd":0.005805,"raw_usage":{"total_tokens":2781,"prompt_tokens":703,"num_sources_used":0,"completion_tokens":72,"cost_in_usd_ticks":58049500,"prompt_tokens_details":{"text_tokens":703,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2006,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":703,"tokens_out":72,"duration_ms":14760,"temperature":1.0,"reasoning_tokens":2006,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-27T11:59:34.501958+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A single explicit construction of a bounded-support K and a Poisson realization on which the walk visits infinitely many points with positive probability would disprove the main claim.","supporting_citations":[],"review_version":1}