Immune networks: multi-tasking capabilities near saturation
arXiv:1305.5936 · doi:10.1088/1751-8113/46/41/415003
Abstract
Pattern-diluted associative networks were introduced recently as models for the immune system, with nodes representing T-lymphocytes and stored patterns representing signalling protocols between T- and B-lymphocytes. It was shown earlier that in the regime of extreme pattern dilution, a system with T-lymphocytes can manage a number $N_B!=!\order(N_T^δ)$ of B-lymphocytes simultaneously, with . Here we study this model in the extensive load regime , with also a high degree of pattern dilution, in agreement with immunological findings. We use graph theory and statistical mechanical analysis based on replica methods to show that in the finite-connectivity regime, where each T-lymphocyte interacts with a finite number of B-lymphocytes as , the T-lymphocytes can coordinate effective immune responses to an extensive number of distinct antigen invasions in parallel. As increases, the system eventually undergoes a second order transition to a phase with clonal cross-talk interference, where the system's performance degrades gracefully. Mathematically, the model is equivalent to a spin system on a finitely connected graph with many short loops, so one would expect the available analytical methods, which all assume locally tree-like graphs, to fail. Yet it turns out to be solvable. Our results are supported by numerical simulations.
References in corpus (19)
- Statistical mechanics of complex networks
- The spread of epidemic disease on networks
- The Bethe lattice spin glass revisited
- Maximum entropy models for antibody diversity
- Multitasking associative networks
- The replica symmetric behavior of the analogical neural network
- Finite Connectivity Attractor Neural Networks
- Thymic selection of T-cell receptors as an extreme value problem
- A thermodynamical perspective of immune capabilities
- Finitely connected vector spin systems with random matrix interactions
- Analytic solution of attractor neural networks on scale-free graphs
- A Hebbian approach to complex network generation
- Dynamical replica analysis of disordered Ising spin systems on finitely connected random graphs
- A statistical mechanics approach to autopoietic immune networks
- Parallel processing in immune networks
- Organization and evolution of synthetic idiotypic networks
- Equilibrium statistical mechanics on correlated random graphs
- Randomly Evolving Idiotypic Networks: Structural Properties and Architecture
- Slowly evolving geometry in recurrent neural networks I: extreme dilution regime
Cited by in corpus (26)
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- Emergence of Compositional Representations in Restricted Boltzmann Machines
- Efficiency of attack strategies on complex model and real-world networks
- Towards the development of human immune-system-on-a-chip platforms
- Cancer-driven dynamics of immune cells in a microfluidic environment
- Phase Diagram of Restricted Boltzmann Machines and Generalised Hopfield Networks with Arbitrary Priors
- Extensive load in multitasking associative networks
- Phase transitions in Restricted Boltzmann Machines with generic priors
- Linear stability analysis for large dynamical systems on directed random graphs
- Non-Convex Multi-species Hopfield models
- Hierarchical neural networks perform both serial and parallel processing
- Statistical Physics and Representations in Real and Artificial Neural Networks
- Reproducing size distributions of swarms of barchan dunes on Mars and Earth using a mean-field model
- Complete integrability of information processing by biochemical reactions
- Replica methods for loopy sparse random graphs
- Hopfield model with planted patterns: a teacher-student self-supervised learning model
- Parallel Learning by Multitasking Neural Networks
- A combined model of aggregation, fragmentation, and exchange processes: insights from analytical calculations
- Dense Hopfield Networks in the Teacher-Student Setting
- Constructions and properties of a class of random scale-free networks
- Graph's Topology and Free Energy of a Spin Model on the Graph
- PDE/statistical mechanics duality: relation between Guerra's interpolated -spin ferromagnets and the Burgers hierarchy
- Vitality of Neural Networks under Reoccurring Catastrophic Failures
- The relativistic Hopfield model with correlated patterns
- Uncovering the non-equilibrium stationary properties in sparse Boolean networks
- Overcoming the complexity barrier of the dynamic message-passing method in networks with fat-tailed degree distributions