{'fraction_non_alphanumeric': 0.02586206896551724, 'fraction_numerical': 0.0, 'mean_word_length': 5.040462427745664, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Probabilistic Algorithm to Estimate the Spectral Moments of Large Undirected Weighted Graphs

Complex networks are often used to model real systems. Examples of such networks include computer networks, cities in a state or countries interconnected by highways, the connection between neurons in the brain, atoms in a molecule, and relations between people in a social network. A graph can represent any complex network, and we can use a matrix to represent a graph. Graph spectrum is the eigenvalues of the matrix associated with the graph, and the spectral moments are the moments of the distribution of these eigenvalues. The spectral moments give us intuitions about the shape of the distribution of the eigenvalues, and it can be used to study complex networks. In this work, we show an algorithm (implemented in C) that can efficiently estimate the spectrum moments of an undirected weighted graph. The implementation of this algorithm is freely available to download at GitHub (https://github.com/GuDiasOliveira/graph-spectral-moments).