Filtering Statistics on Networks

• Main Authors: G. J. Baxter, R. A. da Costa, S. N. Dorogovtsev, J. F. F. Mendes
• Format: Article
• Language: English
• Published: MDPI AG 2020-10-01
• Series: Entropy
• Subjects: filtering; information; degeneracy; entropy; relevance; resolution
• Online Access: https://www.mdpi.com/1099-4300/22/10/1149

Compression, filtering, and cryptography, as well as the sampling of complex systems, can be seen as processing information. A large initial configuration or input space is nontrivially mapped to a smaller set of output or final states. We explored the statistics of filtering of simple patterns on a number of deterministic and random graphs as a tractable example of such information processing in complex systems. In this problem, multiple inputs map to the same output, and the statistics of filtering is represented by the distribution of this degeneracy. For a few simple filter patterns on a ring, we obtained an exact solution of the problem and numerically described more difficult filter setups. For each of the filter patterns and networks, we found three key numbers that essentially describe the statistics of filtering and compared them for different networks. Our results for networks with diverse architectures are essentially determined by two factors: whether the graphs structure is deterministic or random and the vertex degree. We find that filtering in random graphs produces much richer statistics than in deterministic graphs, reflecting the greater complexity of such graphs. Increasing the graph’s degree reduces this statistical richness, while being at its maximum at the smallest degree not equal to two. A filter pattern with a strong dependence on the neighbourhood of a node is much more sensitive to these effects.