{'fraction_non_alphanumeric': 0.013415892672858616, 'fraction_numerical': 0.0, 'mean_word_length': 5.217948717948718, '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}}
Interpolation of graph signals using shift-invariant graph filters

New schemes to recover signals defined in the nodes of a graph are proposed. Our focus is on reconstructing bandlimited graph signals, which are signals that admit a sparse representation in a frequency domain related to the structure of the graph. The schemes are designed within the framework of linear shift-invariant graph filters and consider that the seeding signals are injected only at a subset of interpolating nodes. After several sequential applications of the graph-shift operator - which computes linear combinations of the information available at neighboring nodes - the seeding signals are diffused across the graph and the original bandlimited signal is eventually recovered. Conditions under which the recovery is feasible are given, and the corresponding schemes to recover the signal are proposed. Connections with the classical interpolation in the time domain are also discussed.