The wild binary segmentation (WBS) algorithm proposed in [1]}
sets out to remedy the limitation of BS
by scanning the data over a random grid
\(\mathcal {R}_n \subset \mathcal {I}_2 := \lbrace (s, e): \, 0 \le s < e \le n\rbrace \) ,
which amounts to examining
\(\mathcal {T}_{s, k, e}(X), \, (s, k, e) \in \mathcal {S}_{\text{W}}(\mathcal {R}_n)\)  with
\(\mathcal {S}_{\text{W}}(\mathcal {R}_n) = \left\lbrace  (s, k, e): \, k = s + 1, \ldots , e, \, (s, e) \in \mathcal {R}_n\right\rbrace .\) 
