{'fraction_non_alphanumeric': 0.016666666666666666, 'fraction_numerical': 0.0, 'mean_word_length': 4.812903225806451, '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}}
The spectrum of a random operator is a random set

The theory of random sets is demonstrated to prove useful for the theory of random operators. A random operator is here defined by requiring the graph to be a random set. It is proved that the spectrum and the set of eigenvalues of random operators are random sets. These results seem to be a novelty even in the case of random bounded operators. The main technical tools are given by the measurable selection theorem, the measurable projection theorem, and a characterisation of the spectrum by approximate eigenvalues of the operator and the adjoint operator. A discussion of some of the existing definitions of the concept of a random operator is included at the end of the paper. 
Keywords: Random operators; Set-valued functions; General topics in linear spectral theory; Random operators and equations; Stochastic integrals; Disordered systems