{'fraction_non_alphanumeric': 0.022628372497824196, 'fraction_numerical': 0.0, 'mean_word_length': 5.052631578947368, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Asymptotic properties of subband identification

The purpose of the paper is to study the asymptotic properties (i.e., strong convergence and asymptotic convergence rate) of the subband identification method in every subband and in the overall method. The study of strong convergence aims to answer the question whether the "best possible" model is retrieved, on the limit, with probability one. The study of the asymptotic convergence rate aims to give an expression that quantifies how fast the model approaches the "best possible" value as the number of samples goes to infinity. To do this, we need to generalize existing results for fullband identification. In the process of doing so, we come up with a new notion of ergodicity, which we call strong ergodicity. Strongly ergodic signals not only satisfy the assumptions required for our analysis but also enjoy an interesting property, which is that strong ergodicity is invariant under a number of transformations. In particular, the subband components of a strongly ergodic signal are guaranteed to be strongly ergodic, therefore, ergodic, which is not true for an ergodic signal in general.