Patterns in randomly evolving networks: Idiotypic networks
M. Brede, U. Behn

TL;DR
This paper models the evolution of networks on regular graphs, revealing stable and dynamic patterns influenced by parameters, with applications to immune system networks and broad implications for complex network analysis.
Contribution
It introduces a novel model for network evolution with thresholds, analyzing pattern formation, stability, and transitions, especially in the context of idiotypic immune networks.
Findings
Stable long-living patterns on low connectivity graphs
Dynamic patterns and transitions on high connectivity graphs
Application to immune system network modeling
Abstract
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 distinguish two types of pattern: static patterns arising on graphs with low connectivity and dynamic patterns found on high connectivity graphs. Increasing I patterns become unstable and transitions between almost stable patterns, interrupted by disordered phases, occur. For still larger I the lifetime of occupied sites becomes very small and network structures are dominated by randomness. We develop methods to analyze…
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.
