Immune networks: multi-tasking capabilities at medium load

We are interested in modeling theoretical immunology within a statistical mechanics flavor: focusing on the antigen-independent maturation process of B-cells, in this paper we try to revise the problem of self vs non-self discrimination by mature B lymphocytes. We consider only B lymphocytes: despite this is of course an oversimplification, however such a toy model may help to highlight features of their interactions otherwise shadowed by main driven mechanisms due to i.e. he...

Hopfield model is one of the few neural networks for which analytical results can be obtained. However, most of them are derived under the assumption of random uncorrelated patterns, while in real life applications data to be stored show non-trivial correlations. In the present paper we study how the retrieval capability of the Hopfield network at null temperature is affected by spatial correlations in the data we feed to it. In particular, we use as patterns to be stored the...

I introduce a novel associative memory model named Correlated Dense Associative Memory (CDAM), which integrates both auto- and hetero-association in a unified framework for continuous-valued memory patterns. Employing an arbitrary graph structure to semantically link memory patterns, CDAM is theoretically and numerically analysed, revealing four distinct dynamical modes: auto-association, narrow hetero-association, wide hetero-association, and neutral quiescence. Drawing insp...

We present a model for the evolution of networks of occupied sites on undirected regular graphs. At every iteration step in a parallel update I randomly chosen empty sites are occupied and occupied sites having degree outside of a given interval (t_l,t_u) are set empty. Depending on the influx I and the values of both lower threshold and upper threshold of the degree different kinds of behaviour can be observed. In certain regimes stable long-living patterns appear. We distin...

We argue that immune system is an adaptive complex system. It is shown that it has emergent properties. Its network structure is of the small world network type. The network is of the threshold type, which helps in avoiding autoimmunity. It has the property that every antigen (e.g.virus or bacteria) is typically attacked by more than one effector. This stabilizes the equilibrium state. Modelling complex systems is discussed. Cellular automata (CA) type models are successful b...

We consider the multitasking associative network in the low-storage limit and we study its phase diagram with respect to the noise level $T$ and the degree $d$ of dilution in pattern entries. We find that the system is characterized by a rich variety of stable states, among which pure states, parallel retrieval states, hierarchically organized states and symmetric mixtures (remarkably, both even and odd), whose complexity increases as the number of patterns $P$ grows. The ana...

The Hopfield model is a pioneering neural network model with associative memory retrieval. The analytical solution of the model in mean field limit revealed that memories can be retrieved without any error up to a finite storage capacity of $O(N)$, where $N$ is the system size. Beyond the threshold, they are completely lost. Since the introduction of the Hopfield model, the theory of neural networks has been further developed toward realistic neural networks using analog neur...

We consider self-tolerance and its failure -autoimmunity- in a minimal mathematical model of the idiotypic network. A node in the network represents a clone of B-lymphocytes and its antibodies of the same idiotype which is encoded by a bitstring. The links between nodes represent possible interactions between clones of almost complementary idiotype. A clone survives only if the number of populated neighbored nodes is neither too small nor too large. The dynamics is driven by ...

We consider the storage properties of temporal patterns, i.e. cycles of finite lengths, in neural networks represented by (generally asymmetric) spin glasses defined on random graphs. Inspired by the observation that dynamics on sparse systems have more basins of attractions than the dynamics of densely connected ones, we consider the attractors of a greedy dynamics in sparse topologies, considered as proxy for the stored memories. We enumerate them using numerical simulation...

We consider the problem of neural association for a network of non-binary neurons. Here, the task is to first memorize a set of patterns using a network of neurons whose states assume values from a finite number of integer levels. Later, the same network should be able to recall previously memorized patterns from their noisy versions. Prior work in this area consider storing a finite number of purely random patterns, and have shown that the pattern retrieval capacities (maxim...