Explicit solutions of the SI and Bass models on sparse Erdos-R\'enyi and regular networks
Abstract
We derive explicit expressions for the expected adoption and infection level in the Bass and SI models, respectively, on sparse Erdos-R\'enyi networks and on d-regular networks. These expressions are soloutions of first-order ordinary differential equations, which are fairly easy to analyze. To prove that these expressions are exact, we show that the effect of cycles vanishes as the network size goes to infinity.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.