Immune networks: multi-tasking capabilities near saturation
Elena Agliari, Alessia Annibale, Adriano Barra, A.C.C. Coolen, Daniele, Tantari

TL;DR
This paper models immune networks as sparse graph spin systems, demonstrating that T-lymphocytes can coordinate responses to many antigens simultaneously, with performance degrading gracefully at high loads.
Contribution
It extends previous models by analyzing immune network capacity in the extensive load regime using advanced statistical mechanics, showing solvability despite complex graph structures.
Findings
T-lymphocytes can handle extensive antigen diversity in parallel.
System undergoes a second order transition with increasing load.
Performance degrades gracefully under high pattern dilution.
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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
