{'fraction_non_alphanumeric': 0.015384615384615385, 'fraction_numerical': 0.0, 'mean_word_length': 4.979591836734694, '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}}
Filtering Methods for Subgraph Matching on Multiplex Networks

We present filtering methods for finding all sub-graphs of a large multiplex network that are isomorphic to a smaller template network. These methods are shown to be effective on a set of synthetic transaction networks from the DARPA Modeling Adversarial Activity (MAA) program. In some cases, filtering allows us to identify and enumerate all possible isomorphisms. We observe that in some of the MAA networks, the number of subgraphs isomorphic to the template is orders of magnitude larger than the size of the network.