{'fraction_non_alphanumeric': 0.04633204633204633, 'fraction_numerical': 0.0019305019305019305, 'mean_word_length': 4.641304347826087, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Limit theorems for triangular arrays under a relaxed asymptotic negligibility condition

Abstract Let {Xnk} be a triangular array of independent random variables satisfying the so-called tail-negligibility condition, i.e. such that Prob{|Xnk| > a} → 0 as both k, n → ∞. It is also assumed that for each fixed k, Xnk converges in distribution as n → ∞. Theorems on the asymptotic behavior of the row sums of the array, analogous to those of the classical theory under the uniform negligibility condition, are presented.