Pith. sign in

REVIEW 4 major objections 5 minor 57 references

At the edge of Donsker's Theorem: Asymptotics of multiscale scan statistics

T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proves that the multiplicatively weighted multiscale scan statistic is asymptotically pivotal under sub-Gaussian noise, through a new thresholded form of weak convergence that salvages distributional limits exactly where…

desk verdict A genuine probabilistic novelty—thresholded weak convergence at the critical Hölder modulus—with a statistical wrapper whose 'feasibility' claim overreaches because the alpha condition depends on an unknown tail constant. read the letter →

arxiv 2506.05112 v1 pith:ZMIMG3GR submitted 2025-06-05 math.ST stat.MEstat.TH

Johann Köhne , Fabian Mies This is my paper
classification math.STstat.MEstat.TH MSC 60F1762G1062G2062M10
keywords multiscaletestingthresholdedweakconvergencescanstatisticHölderspacessub-Gaussianerrorschangepointdetectiongoodness-of-fitlocallystationarytimeseries
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper sets out to fix a gap in multiscale testing: the standard multiscale scan statistic, which subtracts a scale-dependent penalty, only works for Gaussian noise and collapses for slightly heavier sub-Gaussian errors. The authors propose replacing the additive penalty by a multiplicative weight, giving the statistic $T^*_n = \max_I T_n(I)/\sqrt{\log(en/|I|)}$. They prove this statistic is asymptotically pivotal under sub-Gaussian errors in a new thresholded sense: tail probabilities converge to those of a Hölder seminorm of Brownian motion, but only above a threshold tied to the unknown tail constant. Because critical values can be computed from Brownian motion once the noise variance is estimated, the test is feasible in practice, preserves optimal detection rates, and extends to nonstationary dependent data via bootstrap.

What carries the argument

The engine is thresholded weak convergence: a sequence of random variables $X_n$ converges beyond a threshold $\tau$ to $X$ if $P(X_n>t)\to P(X>t)$ for every continuity point $t>\tau$. The sufficient criterion in Theorem 2.2 combines a sub-Gaussian tail bound on increments with a scaling property of the modulus, producing control of the Hölder seminorm in the upper tail despite the failure of tightness in the full space $C^{\rho_2}$. This turns Donsker's theorem at its edge of validity into a statistically usable statement.

What would settle it

Simulate the signal discovery null with $n=50{,}000$ iid draws from the mixture $\frac12 N(0,2)+\frac12\delta_0$ and record the empirical rejection rate at nominal 10% using the Brownian-motion critical value; the paper's Table 3 already reports roughly 46% rejection, showing that the claimed size control fails exactly when $q_\alpha \le C_\eta$.

Watch

Extended reading notes

Core claim

The central claim is that the multiplicatively weighted scan statistic admits a distributional limit even though the usual functional central limit theorem fails at the critical modulus of continuity $\rho_2(h)=\sqrt{h\log(e/h)}$. Concretely, for iid centered sub-Gaussian errors with unit variance, $|\tilde S_n|_{\rho_2}/\sigma$ converges in tail to $|B|_{\rho_2}$ for thresholds above the tail constant $C_\eta$, where $B$ is standard Brownian motion. The paper shows that the convergence genuinely does not hold below that threshold, so the thresholding is a real property of the statistic rather than an artifact of the proof.

Load-bearing premise

Everything rests on the assumption that errors are sub-Gaussian with a finite constant $C_\eta$ that is never estimated: the size guarantee holds only when the chosen significance level has critical value $q_\alpha > C_\eta$, so in practice a user cannot verify that the level is small enough.

Editorial extensions

If this is right

  • For iid sub-Gaussian noise, the test $T^*_n$ with Brownian-motion critical values has asymptotic size at most $\alpha$ whenever the quantile $q_\alpha$ exceeds the unknown tail constant $C_\eta$.
  • A signal with amplitude $\mu_n$ and length $\ell_n$ is consistently detected whenever $\mu_n^2\ell_n \gg \log(en/\ell_n)$, the same optimal rate as the Gaussian multiscale statistic.
  • Goodness-of-fit testing and multiple changepoint localization inherit the same validity, with changepoint localization rates matching statistical lower bounds.
  • A multiplier bootstrap based on block sums gives critical values for nonstationary, locally stationary dependent errors, provided the block length and cutoff satisfy stated rates.
  • Sparse dyadic and Rivera-Walther grids reduce computation to $O(n)$ or $O(n\log n)$ without sacrificing the asymptotic detection guarantees.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Extension: the same thresholded-limit mechanism should transfer to other sup-functionals over Hölder seminorms, such as density or deconvolution settings, wherever sub-Gaussian tail bounds replace Gaussianity.
  • Extension: the unknown $C_\eta$ threshold suggests a practical diagnostic, namely estimating the effective tail constant from residuals and checking $q_\alpha > C_\eta$ before trusting a chosen level; the paper does not implement such a check.
  • Extension: a data-driven choice of the modulus parameter $a$ in $\rho_{2,a}(h)=\sqrt{h(a+\log(e/h))}$ could trade short-signal power against robustness without obviously losing the threshold guarantee, and that trade-off is testable by simulation.
  • Extension: for changepoint inference the paper leaves open whether the sharper Gaussian localization rate $O(1/\delta_k^2)$ can be reached for non-Gaussian errors, which is a natural next target.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. This paper introduces a notion of thresholded weak convergence and proves that interpolated partial sum processes of sub-Gaussian innovations satisfy such convergence for the H\"older-type seminorm with critical modulus \rho_2(h)=\sqrt{h\log(e/h)}, even though classical weak convergence in the space C^{\rho_2} fails. On this basis the authors construct multiplicatively weighted multiscale tests for signal detection, goodness-of-fit, and multiple changepoint localization, extend the results to locally stationary nonlinear time series through a physical-dependence concentration inequality and a bootstrap, and illustrate the methodology with simulations and an analysis of the April 2025 Iberian power-grid blackout.

Significance. The concept of thresholded weak convergence at the critical H\"older modulus is novel and potentially useful beyond the present applications; the paper correctly identifies a genuine boundary phenomenon in Donsker-type theorems. The statistical motivation for replacing the additive multiscale penalty by a multiplicative weight is well argued, and the paper contains a substantial simulation study and a real-data application. The proofs are conventional and largely reproducible in structure. However, several quantitative claims that are load-bearing for the advertised feasibility are not correct as stated: the threshold in the main convergence theorem appears to be off by a factor, the dependent-data concentration inequality omits a leading term, and the condition for size control depends on an unknown and unestimated sub-Gaussian constant. These issues require substantial revision before the results can be accepted.

major comments (4)
  1. [Corollary 2.6 and Theorem 3.1] The stated threshold is not the correct one for the sub-Gaussian constant. For innovations satisfying E exp(r\eta_t) \le \exp(r^2/C^2), the tail of a normalized sum over an interval of length h has the form P(|W_n(u)-W_n(v)|/\rho_2(h)>t) \le 2\exp(-C^2 t^2 \log(1/h)/4) = 2 h^{C^2 t^2/4}. Thus in condition (T) of Theorem 2.2 one has \kappa(t)=C^2 t^2/4, and \kappa(t)>1 requires t>2/C, not t>C. Corollary 2.6 and Theorem 3.1 therefore need the condition q_\alpha > 2/C_\eta rather than q_\alpha > C_\eta. The simulation evidence in Table 3 is consistent with the corrected threshold: for mixture (c), C_\eta=1, 2/C_\eta=2, q_{10\%}=1.907<2 and the size does not approach 10\%, whereas q_{0.1\%}=3.316>2 and the size is near nominal. As written, Corollary 2.6 is quantitatively false for, e.g., \eta_t \sim \frac12 N(0,2)+\frac12\delta_0.
  2. [Theorem 2.8] The sub-Gaussian concentration inequality for dependent data is missing the leading term. The statement bounds \|\sum_{t=1}^n w_t\eta_t\|_{\psi_2} by K\sqrt{\sum_t |w_t|^2}\,\sum_{j=1}^\infty \sqrt{j}\,\delta_{\psi_2}(j). For iid innovations, \delta_{\psi_2}(j)=0 for all j\ge1, so the right-hand side is zero while the left-hand side is generally positive and of order \sqrt{n}. The proof telescopes from S_{n,0}=\sum_t w_t E(\eta_t|\epsilon_t), which is not S_n; the j=0 term carries the main contribution and is omitted from the series. Corollary 2.10 relies on Theorem 2.8, so the dependent-data extension is not supported as stated. The series should include a j=0 term (e.g., \delta_{\psi_2}(0)=\sup_t\|\eta_t\|_{\psi_2}) and the proof adjusted accordingly.
  3. [Theorem 3.1 and Proposition 2.7] The size guarantee depends on the unverifiable condition q_\alpha > 2/C_\eta (or, as stated in the paper, q_\alpha > C_\eta). The paper estimates only the variance \sigma^2 and provides no estimator, diagnostic, or upper bound for C_\eta. Proposition 2.7 shows that for any finite T there exists a unit-variance, centered, sub-Gaussian law with \liminf_{n\to\infty} P(|\tilde S_n|_{\rho_2}\ge T)=1; taking T=q_\alpha, for every preset \alpha there is a distribution in the stated class for which the test has asymptotic size 1. The abstract's claim of a 'feasible multiscale test' that is 'agnostic of the exact tail bound' is therefore overstated: the procedure is feasible only for significance levels below an unknown \alpha_0. The authors should either provide a way to estimate or bound the threshold or carefully delimit the feasibility claim in the abstract and in Sections 1 and 3.1.
  4. [Appendix, proof of Theorem 2.2] The stochastic boundedness argument contains a gap. The proof uses Q(t/3,1/N) \le Q(2,1/N) and then chooses N so that Q(2,1/N)<\varepsilon/2. This requires the number 2 to exceed the threshold C in condition (T). The theorem does not assume C<2, and in the dependent-data setting C may exceed 2, so the chosen N need not exist. This step should be replaced, for example by letting t\to\infty for a suitable N using the fact that Q(t/3,1/N)\to0 for t>C, together with a more careful control of the finite-dimensional term, or by an alternative tightness argument. As written, the proof of the first claim in (4) is incomplete.
minor comments (5)
  1. [Figure 1 caption] The caption contains the typo 'Gassian'; it should read 'Gaussian'.
  2. [Section 4.3 / Figure 3 caption] The text states the intervals are declared at nominal significance level 1% (99% confidence), but the caption says 'significant at 95%'. These should be made consistent.
  3. [Section 3.5] The sentence 'the the threshold \tau is the same' contains a duplicated 'the'.
  4. [Section 1 and Table 2] There are typos: 'loosing too much finite sample power' should be 'losing', and in Table 2 'comparsion' should be 'comparison'.
  5. [Definition 2.1] The phrase 'A a sequence of real-valued random variables' should read 'A sequence of real-valued random variables'.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the upper-tail limit is derived from increment tail bounds plus finite-dimensional convergence, and the cited prior work is used as external lemmas.

full rationale

I traced the derivation chain. The central result Theorem 2.2 takes a tail condition (T) and the regularity condition (R), proves local sup-norm tightness (3), and combines it with finite-dimensional convergence to obtain the thresholded convergence (4). Corollary 2.6 verifies (T) for iid sub-Gaussian increments directly via Hoeffding's inequality, so the Brownian limit is not smuggled into the conclusion. Theorem 3.1 then applies Corollary 2.6 and the consistency of the difference-based variance estimator; the critical values are Gaussian quantiles of |B|_{rho2} computed independently by simulation, not fitted to the noise distribution. No fitted parameter is renamed as a prediction. The paper's self-citations (Mies 2023, 2024; Mies & Steland 2023) supply finite-dimensional convergence and long-run variance estimation for the dependent-data extension; these are separate published results whose content is not the paper's thresholded weak convergence claim, so they are not load-bearing circularity. The condition q_alpha > C_eta is a genuine feasibility limitation: the paper itself states that the lower part of the distribution is distribution-dependent (Proposition 2.7) and Table 3 shows size inflation when the condition fails. That is a limitation of the statistical guarantee, not a reduction of the derivation to its inputs. I therefore find no circular step.

Assumptions & free parameters 3 free parameters · 6 assumptions · 0 invented entities

The central derivation relies on standard probability tools and two explicit domain assumptions (sub-Gaussian noise, local stationarity with physical dependence decay). No new physical or model entities are introduced; 'thresholded weak convergence' is a mathematical concept, not an entity. The tuning parameters (a, b_n, c_n) are user-selected and do not alter the asymptotic results.

free parameters (3)
  • a in rho2,a(h) = sqrt(h(a + log(e/h))) = 50, 100, 500, 1000 in tables
    User-chosen tuning parameter to improve finite-sample power against short signals; asymptotic validity holds for any a >= 0, so it does not affect the central derivation.
  • Bootstrap block size b_n = For example 3 log10(n)^2 in the data example; log10(n)^2 in simulations
    User-chosen bandwidth for local long-run variance estimation in Theorem 3.7; must satisfy 1 << b_n << n.
  • Bootstrap cutoff c_n = n^{-0.33} and n^{-0.45} in simulations
    User-chosen lower bound on interval length for bootstrap critical values; must satisfy the rate condition 1 >> c_n >> sqrt(v_n b_n / n) in Theorem 3.7.
assumptions (6)
  • domain assumption Sub-Gaussian errors: E exp(r eta_t) <= exp(r^2/C_eta^2) for iid noise
    Used in Corollary 2.6, Theorem 3.1, Theorem 3.3; the threshold C_eta is the sub-Gaussian constant.
  • domain assumption Local stationarity of the Bernoulli shift process: (LS-1), (LS-2), and physical dependence decay delta_psi2(h) = O(h^{-beta}) with beta > 3/2 (or beta > 2 for Theorem 3.7)
    Assumed for the nonstationary time series extension, Corollary 2.10 and Theorem 3.7.
  • standard math Donsker's theorem / functional central limit theorem
    Used in Section 2 as the baseline for weak convergence in C[0,1].
  • standard math Theorem 5.1 of Mies and Steland (2023) on the uniform consistency of the local long-run variance estimator
    Invoked in Lemma A.4 to prove the bootstrap critical values; an external, self-cited published result.
  • standard math Continuity of the distribution of sup-type functionals of Gaussian processes (Lifshits 1984)
    Used in the proof of Theorem 3.7 to get quantile convergence.
  • standard math Hoeffding's inequality for sub-Gaussian sums
    Used to verify condition (T) for iid sub-Gaussian partial sums in Corollary 2.6.

how reviews work

0 comments
Cite this review

Pith. "Pith review of At the edge of Donsker's Theorem: Asymptotics of multiscale scan statistics." pith.science (2026). https://pith.science/paper/ZMIMG3GR

@misc{pith2026250605112,
  author       = {Pith},
  title        = {Pith review of: At the edge of Donsker's Theorem: Asymptotics of multiscale scan statistics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZMIMG3GR}},
  note         = {Machine review of arXiv:2506.05112}
}
read the original abstract

For nonparametric inference about a function, multiscale testing procedures resolve the need for bandwidth selection and achieve asymptotically optimal detection performance against a broad range of alternatives. However, critical values strongly depend on the noise distribution, and we argue that existing methods are either statistically infeasible, or asymptotically sub-optimal. To address this methodological challenge, we show how to develop a feasible multiscale test via weak convergence arguments, by replacing the additive multiscale penalty with a multiplicative weighting. This new theoretical foundation preserves the optimal detection properties of multiscale tests and extends their applicability to nonstationary nonlinear time series via a tailored bootstrap scheme. Inference for signal discovery, goodness-of-fit testing of regression functions, and multiple changepoint detection is studied in detail, and we apply the new methodology to analyze the April 2025 power blackout on the Iberian peninsula. Our methodology is enabled by a novel functional central limit in H\"older spaces with critical modulus of continuity, where Donsker's theorem fails to hold due to lack of tightness. Probabilistically, we discover a novel form of thresholded weak convergence that holds only in the upper support of the distribution.

Figures

Figures reproduced from arXiv: 2506.05112 by the authors.

Figure 1
Figure 1. We term this novel phenomenon thresholded weak convergence, and we study its properties in more detail in Section 2. The implication of this probabilistic result for statistical inference is that we may choose critical values based on the pivotal limit distribution of |B|ρ2 , and for sufficiently small significance level α ≤ α0, these critical values will be asymptotically valid. We stress that α0 does not vanish as… view at source ↗
Figure 1
Figure 1. Survival functions of |Sn|ρ2,Gdyadic for different sample sizes with noise distribu￾tion U(− √ 3, √ 3) (left) and 1 2N (0, 2)+ 1 2 δ0 (right), compared to the Gassian counterpart. The reported distributions are based on 105 simulations. and its asymptotic counterpart are very close. For the uniform innovations (b), the approximation is accurate for significance levels below 1% at small sample sizes, and below 10% fo… view at source ↗
Figure 2
Figure 2. The blocks signal of Fryzlewicz (2014) (blue line), nonstationary noisy ob￾servations (gray), and intervals of significance for the changepoints (shaded areas). bound cn = n −0.45 and block-size b = 10, and modulus ρ2,1000 to put more emphasis on shorter intervals. The same simulation is repeated 104 times, and [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figures from the paper (1 more)
Figure 3
Figure 3. Figure 3: Top: Grid frequency ft measured in Freiburg on April 28, 2025, between 10:00 and 11:00, at 100ms resolution. Bottom: Absolute differences yt of two measurements (RoCoF). Shaded areas are significant at 95% to contain a changepoint in RoCoF. Cauchy with respect to |·(0)…

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

57 extracted references · 52 canonical work pages

  1. [1]

    , Candès, E

    Arias-Castro, E. , Candès, E. J. & Durand, A. (2011). Detection of an anomalous cluster in a network. The Annals of Statistics 39

    work page 2011

  2. [2]

    Multiscale detection of practically significant changes in a gradually varying time series

    Bastian, P. & Dette, H. (2025). Multiscale detection of practically significant changes in a gradually varying time series. ArXiv:2504.15872 [stat]

    work page Pith review arXiv 2025

  3. [3]

    Billingsley, P. (1999). Convergence of Probability Measures . John Wiley & Sons

    work page 1999

  4. [4]

    Chan, H. P. & Walther, G. (2013). Detection with the scan and the average likelihood ratio. Statistica Sinica , 409--428Publisher: JSTOR

    work page 2013

  5. [5]

    & Lafferty, J

    Chatterjee, S. & Lafferty, J. (2019). Adaptive risk bounds in unimodal regression. Bernoulli 25

    work page 2019

  6. [6]

    & Kirch, C

    Cho, H. & Kirch, C. (2021). Data segmentation algorithms: Univariate mean change and beyond. Econometrics and Statistics , S2452306221001234

    work page 2021

  7. [7]

    , Levine, M

    Cui, Y. , Levine, M. & Zhou, Z. (2021). Estimation and inference of time-varying auto-covariance under complex trend: A difference-based approach. Electronic Journal of Statistics 15

    work page 2021

  8. [8]

    Dahlhaus, R. (1997). Fitting time series models to nonstationary processes. Annals of Statistics 25, 1--37

    work page 1997

Show all 57 references
  1. [9]

    , Richter, S

    Dahlhaus, R. , Richter, S. & Wu, W. B. (2019). Towards a general theory for nonlinear locally stationary processes. Bernoulli 25, 1013--1044

    2019

  2. [10]

    , Eckle, T

    Dette, H. , Eckle, T. & Vetter, M. (2020). Multiscale change point detection for dependent data. Scandinavian Journal of Statistics 47, 1243--1274

    2020

  3. [11]

    Dette, H. , Wu, W. & Zhou, Z. (2019). Change Point Analysis of Correlation in Non -stationary Time Series . Statistica Sinica 29, 611--643. ArXiv: 1801.10478

    2019 arXiv

  4. [12]

    & Spokoiny, V

    Dümbgen, L. & Spokoiny, V. G. (2001). Multiscale Testing of Qualitative Hypotheses . The Annals of Statistics 29

    2001

  5. [13]

    & Walther, G

    Dümbgen, L. & Walther, G. (2008). Multiscale inference about a density. The Annals of Statistics 36

    2008

  6. [14]

    ENTSO-E expert panel initiates the investigation into the causes of Iberian blackout

    ENTSO-E (2025). ENTSO-E expert panel initiates the investigation into the causes of Iberian blackout . https://www.entsoe.eu/news/2025/05/09/entso-e-expert-panel-initiates-the-investigation-into-the-causes-of-iberian-blackout/. Retrieved on 2025-05-23

    2025

  7. [15]

    Feng, O. Y. , Chen, Y. , Han, Q. , Carroll, R. J. & Samworth, R. J. (2022). Nonparametric, tuning‐free estimation of S ‐shaped functions. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 84, 1324--1352

    2022

  8. [16]

    , Munk, A

    Frick, K. , Munk, A. & Sieling, H. (2014). Multiscale change point inference. Journal of the Royal Statistical Society: Series B: Statistical Methodology , 495--580Publisher: JSTOR

    2014

  9. [17]

    , Derviskadic, A

    Frigo, G. , Derviskadic, A. , Zuo, Y. & Paolone, M. (2019). PMU - Based ROCOF Measurements : Uncertainty Limits and Metrological Significance in Power System Applications . IEEE Transactions on Instrumentation and Measurement 68, 3810--3822

    2019

  10. [18]

    Fryzlewicz, P. (2014). Wild binary segmentation for multiple change-point detection. The Annals of Statistics 42

    2014

  11. [19]

    (2024 a )

    Fryzlewicz, P. (2024 a ). Narrowest Significance Pursuit : inference for multiple change-points in linear models. Journal of American Statistical Association 119, 1633--1646. ArXiv: 2009.05431

    2024 arXiv

  12. [20]

    (2024 b )

    Fryzlewicz, P. (2024 b ). Robust Narrowest Significance Pursuit : inference for multiple change-points in the median. Journal of Business & Economic Statistics 42, 1389--1402. ArXiv:2109.02487 [stat]

    2024 arXiv

  13. [21]

    & Fryzlewicz, P

    Gavioli-Akilagun, S. & Fryzlewicz, P. (2025). Fast and optimal inference for change points in piecewise polynomials via differencing. Electronic Journal of Statistics 19

    2025

  14. [22]

    , Pozdnyakov, V

    Glaz, J. , Pozdnyakov, V. & Wallenstein, S. , eds. (2009). Scan Statistics : Methods and Applications . Boston, MA: Birkhäuser Boston

    2009

  15. [23]

    Hamadouche, D. (1998). Weak convergence of smoothed empirical process in Hölder spaces. Statistics & Probability Letters 36, 393--400

    1998

  16. [24]

    Hamadouche, D. (2000). Invariance principles in Holder spaces. Portugaliae Mathematica 57, 127--152. Publisher: Lisboa, Gazeta de matematica [etc.]

    2000

  17. [25]

    & Vogt, M

    Khismatullina, M. & Vogt, M. (2020). Multiscale Inference and Long - Run Variance Estimation in Non - Parametric Regression with Time Series Errors . Journal of the Royal Statistical Society Series B: Statistical Methodology 82, 5--37

    2020

  18. [26]

    , Munk, A

    König, C. , Munk, A. & Werner, F. (2020). Multidimensional multiscale scanning in exponential families: Limit theory and statistical consequences. The Annals of Statistics 48

    2020

  19. [27]

    Lamperti, J. (1962). On convergence of stochastic processes. Transactions of the American Mathematical Society 104, 430--435

    1962

  20. [28]

    supremum

    Lifshits, M. A. (1984). Absolute continuity of functionals of “supremum” type for Gaussian processes. Journal of Soviet Mathematics 27, 3103--3112

    1984

  21. [29]

    , Xiao, H

    Liu, W. , Xiao, H. & Wu, W. B. (2013). Probability and moment inequalities under dependence. Statistica Sinica 23, 1257--1272

    2013

  22. [30]

    , Bialek, J

    Machowski, J. , Bialek, J. W. & Bumby, J. R. (2020). Power system dynamics, stability and control. Chichester, G. B: Wiley, 3rd ed

    2020

  23. [31]

    Mies, F. (2023). Functional estimation and change detection for nonstationary time series. Journal of the American Statistical Association 118, 1011--1022

    2023

  24. [32]

    Mies, F. (2024). Strong Gaussian approximations with random multipliers. ArXiv:2412.14346 [math]

    2024 arXiv

  25. [33]

    & Steland, A

    Mies, F. & Steland, A. (2023). Sequential Gaussian approximation for nonstationary time series in high dimensions. Bernoulli 29, 3114--3140

    2023

  26. [34]

    Niu, Y. S. & Zhang, H. (2012). The screening and ranking algorithm to detect DNA copy number variations. The Annals of Applied Statistics 6

    2012

  27. [35]

    , Sieling, H

    Pein, F. , Sieling, H. & Munk, A. (2017). Heterogeneous change point inference. Journal of the Royal Statistical Society. Series B (Statistical Methodology) 79, 1207--1227. Publisher: [Royal Statistical Society, Wiley]

    2017

  28. [36]

    , Carpentier, A

    Pilliat, E. , Carpentier, A. & Verzelen, N. (2023). Optimal multiple change-point detection for high-dimensional data. Electronic Journal of Statistics 17, 1240--1315. ArXiv:2011.07818 [math, stat]

    2023 arXiv

  29. [37]

    Pinelis, I. (1994). Optimum Bounds for the Distributions of Martingales in Banach Spaces . The Annals of Probability 22, 1679--1706

    1994

  30. [38]

    & Suquet, C

    Rackauskas, A. & Suquet, C. (2004 a ). Hölder norm test statistics for epidemic change. Journal of Statistical Planning and Inference 126, 495--520

    2004

  31. [39]

    & Suquet, C

    Rackauskas, A. & Suquet, C. (2004 b ). Necessary and Sufficient Condition for the Functional Central Limit Theorem in Hölder Spaces . Journal of Theoretical Probability 17, 221--243

    2004

  32. [40]

    & Suquet, C

    Rackauskas, A. & Suquet, C. (2004 c ). Necessary and sufficient condition for the Lamperti invariance principle. Theory of Probability and Mathematical Statistics 68, 127--137

    2004

  33. [41]

    & Suquet, C

    Rackauskas, A. & Suquet, C. (2007). Estimating a Changed Segment in a Sample . Acta Applicandae Mathematicae 97, 189--210

    2007

  34. [42]

    & Suquet, C

    Rackauskas, A. & Suquet, C. (2009). Hölderian invariance principle for Hilbertian linear processes. ESAIM: Probability and Statistics 13, 261--275

    2009

  35. [43]

    & Wendler, M

    Rackauskas, A. & Wendler, M. (2020). Convergence of U -processes in Hölder spaces with application to robust detection of a changed segment. Statistical Papers 61, 1409--1435

    2020

  36. [44]

    , Chen, J

    Reeves, J. , Chen, J. , Wang, X. L. , Lund, R. & Lu, Q. Q. (2007). A Review and Comparison of Changepoint Detection Techniques for Climate Data . Journal of Applied Meteorology and Climatology 46, 900--915

    2007

  37. [45]

    & Walther, G

    Rivera, C. & Walther, G. (2013). Optimal detection of a jump in the intensity of a Poisson process or in a density with likelihood ratio statistics. Scandinavian Journal of Statistics 40, 752--769

    2013

  38. [46]

    Rohde, A. (2008). Adaptive goodness-of-fit tests based on signed ranks. The Annals of Statistics 36

    2008

  39. [47]

    Schilling, R. L. (2021). Brownian Motion : a guide to random processes and stochastic calculus . Berlin ; Boston: De Gruyter, 3rd ed

    2021

  40. [48]

    , Munk, A

    Schmidt-Hieber, J. , Munk, A. & Dümbgen, L. (2013). Multiscale methods for shape constraints in deconvolution: Confidence statements for qualitative features. The Annals of Statistics 41

    2013

  41. [49]

    & Arias-Castro, E

    Sharpnack, J. & Arias-Castro, E. (2016). Exact asymptotics for the scan statistic and fast alternatives. Electronic Journal of Statistics 10

    2016

  42. [50]

    , Fromont, M

    Verzelen, N. , Fromont, M. , Lerasle, M. & Reynaud-Bouret, P. (2023). Optimal Change - Point Detection and Localization . The Annals of Statistics 51, 1586--1610. ArXiv: 2010.11470

    2023 arXiv

  43. [51]

    , Girard, S

    Vladimirova, M. , Girard, S. , Nguyen, H. & Arbel, J. (2020). Sub‐ Weibull distributions: Generalizing sub‐ Gaussian and sub‐ Exponential properties to heavier tailed distributions. Stat 9, e318

    2020

  44. [52]

    & Dette, H

    Vogt, M. & Dette, H. (2015). Detecting gradual changes in locally stationary processes. Annals of Statistics 43, 713--740

    2015

  45. [53]

    & Perry, A

    Walther, G. & Perry, A. (2022). Calibrating the Scan Statistic : Finite Sample Performance Versus Asymptotics . Journal of the Royal Statistical Society Series B: Statistical Methodology 84, 1608--1639

    2022

  46. [54]

    Wu, W. B. (2005). Nonlinear system theory: Another look at dependence. Proceedings of the National Academy of Sciences 102, 14150--14154

    2005

  47. [55]

    Wu, W. B. & Zhao, Z. (2007). Inference of trends in time series. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 69, 391--410

    2007

  48. [56]

    Wu, W. B. & Zhou, Z. (2011). Gaussian approximations for non-stationary multiple time series. Statistica Sinica 21, 1397--1413

    2011

  49. [57]

    Zhou, Z. (2013). Heteroscedasticity and autocorrelation robust structural change detection. Journal of the American Statistical Association 108, 726--740

    2013

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.