Preprint Logic and Learning in Network Cascades

This is a preprint of our submitted work.

https://github.com/galenwilkerson/preprint_logic_and_learning_in_network_cascades/blob/master/Logic_and_Learning_in_Network_Cascades___arXiv.pdf

Abstract

Critical cascades are found in many self-organizing systems. Here we examine critical cascades as a design paradigm for logic and learning under the Linear Threshold Model (LTM), and simple biologically-inspired variants of it as sources of computational power, learning efficiency, and robustness. First, we show that the LTM can compute logic, and with a small modification, universal Boolean logic, examining its stability and cascade frequency. We then frame it formally as a binary classifier and remark on implications for accuracy. Second, we examine the LTM as a statistical learning model, studying benefits of spatial constraints and criticality to efficiency. We also discuss implications for robustness in information encoding. Our experiments show that spatial constraints can greatly increase efficiency. Theoretical investigation and initial experimental results also indicate that criticality can result in a sudden increase in accuracy.

Keywords cascades·criticality·percolation·influence maximization·network rewiring·neuronal avalanches,statistical learning·linear threshold model·universal Boolean logic·complex networks