January 17, 2012
We consider a minimalistic dynamic model of the idiotypic network of B-lymphocytes. A network node represents a population of B-lymphocytes of the same specificity (idiotype), which is encoded by a bitstring. The links of the network connect nodes with complementary and nearly complementary bitstrings, allowing for a few mismatches. A node is occupied if a lymphocyte clone of the corresponding idiotype exists, otherwise it is empty. There is a continuous influx of new B-lymphocytes of random idiotype from the bone marrow. B-lymphocytes are stimulated by cross-linking their receptors with complementary structures. If there are too many complementary structures, steric hindrance prevents cross-linking. Stimulated cells proliferate and secrete antibodies of the same idiotype as their receptors, unstimulated lymphocytes die. Depending on few parameters, the autonomous system evolves randomly towards patterns of highly organized architecture, where the nodes can be classified into groups according to their statistical properties. We observe and describe analytically the building principles of these patterns, which allow to calculate number and size of the node groups and the number of links between them. The architecture of all patterns observed so far in simulations can be explained this way. A tool for real-time pattern identification is proposed.
Similar papers 1
August 13, 2002
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...
September 19, 2016
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 ...
August 29, 2013
We consider the problem of self tolerance in the frame of a minimalistic model of the idiotypic network. A node of this network represents a population of B lymphocytes of the same idiotype which is encoded by a bit string. The links of the network connect nodes with (nearly) complementary strings. The population of a node survives if the number of occupied neighbours is not too small and not too large. There is an influx of lymphocytes with random idiotype from the bone marr...
December 9, 2011
We introduce a class of weighted graphs whose properties are meant to mimic the topological features of idiotypic networks, namely the interaction networks involving the B-core of the immune system. Each node is endowed with a bit-string representing the idiotypic specificity of the corresponding B cell and a proper distance between any couple of bit-strings provides the coupling strength between the two nodes. We show that a biased distribution of the entries in bit-strings ...
June 7, 2000
We investigate a model where idiotypes (characterizing B-lymphocytes and antibodies of an immune system) and anti-idiotypes are represented by complementary bitstrings of a given length d allowing for a number of mismatches (matching rules). In this model, the vertices of the hypercube in dimension d represent the potential repertoire of idiotypes. A random set of (with probability p) occupied vertices corresponds to the expressed repertoire of idiotypes at a given moment. Ve...
December 9, 2010
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...
October 23, 2003
The immune system protects the body against health-threatening entities, known as antigens, through very complex interactions involving the antigens and the system's own entities. One remarkable feature resulting from such interactions is the immune system's ability to improve its capability to fight antigens commonly found in the individual's environment. This adaptation process is called the evolution of specificity. In this paper, we introduce a new mathematical model for ...
January 17, 2012
We develop a modular mean field theory for a minimalistic model of the idiotypic network. The model comprises the random influx of new idiotypes and a deterministic selection. It describes the evolution of the idiotypic network towards complex modular architectures, the building principles of which are known. The nodes of the network can be classified into groups of nodes, the modules, which share statistical properties. Each node experiences only the mean influence of the gr...
July 11, 2017
A model of bit-strings, that uses the technique of multi-spin coding, was previously used to study the time evolution of B-cell clone repertoire, in a paper by Lagreca, Almeida and Santos. In this work we extend that simplified model to include independently the role of the populations of antibodies, in the control of the immune response, producing mechanisms of differentiation and regulation in a more complete way. Although the antibodies have the same molecular shape of the...
January 12, 1995
In this paper, after a telegraphic introduction to modern immunology, we present a simple model for the idiotypic network among antibodies and we study its relevance for the maintenance of immunological memory. We also consider the problem of computing the memory capacity of such a model.