{'fraction_non_alphanumeric': 0.020496224379719527, 'fraction_numerical': 0.0, 'mean_word_length': 4.987096774193549, '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}}
SGT toolbox: a playground for spectral graph theory

We present an interactive toolbox application we have developed to enable users to gain an intuitive understanding of the “meaning” of eigenvalues and eigenvectors of graph-related matrices. In addition, we explore spectral embeddings and the effects of graph altering algorithms on the eigenvalues of a graph. Furthermore, we examine Luby’s fast distributed randomized algorithm for finding a maximal independent set (MIS) of a network of nodes. We compare different graph classes with respect to how many rounds the algorithm takes to complete on them on average. We suggest that certain graph classes exhibit a logarithmic lower bound for this number of rounds. Lastly, we prove a logarithmic upper bound for zmax, the largest distance from any vertex to its nearest MIS vertex after one round of Luby’s algorithm, once for path graphs and then for all graphs in general.