Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
representative citing papers
Finite sequential binary data support practical boundary probabilities via reverse-martingale limits rather than exact degeneracy, with a three-condition stopping rule that separates transient from genuine cases.
For polynomially mixing billiards with cusps, Birkhoff sums of observables φ(x) = d(x,x0)^{-2/α} with tail index α satisfy stable laws whose index is a function of both α and the mixing exponent γ when γ ∈ (1/2,1) and α ∈ (0,2) excluding 1.
Optimal O(n^{-1/2}) convergence in trace distance with third moments and O(n^{-1}) in relative entropy with fourth moments for the quantum CLT in m-mode bosonic systems.
Develops target-oriented statistical compression where conditional target processes form reverse martingales, with defects measuring loss in approximate summaries, applied to sequential boundary monitoring.
A derivative-free ensemble Kalman-Bucy smoother is developed for continuous-time data assimilation that supports Bayesian causal inference and iterative model structure identification with small ensemble sizes under partial observations.
citing papers explorer
-
Nonconcentration of hitting times for random walks on graphs
Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.