{'fraction_non_alphanumeric': 0.012302284710017574, 'fraction_numerical': 0.0, 'mean_word_length': 5.195652173913044, '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}}
MOMENT PROPERTIES OF SUBGRAPH COUNTS IN STOCHASTIC GRAPHS

Statistical analysis of stochastic graph models can be based on subgraph counts. General formulas are given which may be used to derive expected values, variances, and covariances of such graph statistics. Three different stochastic graph models are used as illustrations. Moments are given for certain dyad and triad counts in a graph with stochastically independent edge occurrences. Moments are also given for some subgraph count estimators which are based on a partially erased graph or a sampled subgraph.