Explicit solutions of the SI and Bass models on sparse Erdős-Rényi and regular networks
Preprint
Abstract
We derive explicit expressions for the expected adoption and infection level in the Bass and SI models, respectively, on sparse Erdős-Rényi 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.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Funnel theorems for spreading on networksChaos: An Interdisciplinary Journal of Nonlinear Science, 2025
- Explicit solutions of the Bass and susceptible-infected models on hypernetworksPhysical Review E, 2024
- Percolation of new productsPhysica A: Statistical Mechanics and its Applications, 2020
- Bass-SIR model for diffusion of new products in social networksPhysical Review E, 2016
- Exact deterministic representation of Markovian ${ SIR}$ S I R epidemics on networks with and without loopsJournal of Mathematical Biology, 2014
- Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular GraphsCombinatorics, Probability and Computing, 2010
- Generating Random Regular Graphs QuicklyCombinatorics, Probability and Computing, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- The asymptotic distribution of short cycles in random regular graphsJournal of Combinatorial Theory, Series B, 1981
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980