Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Stochastic epidemics on random networks and competition in growth
Stockholm University, Faculty of Science, Department of Mathematics.ORCID iD: 0000-0003-2300-2685
2023 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The COVID-19 pandemic has dramatically demonstrated the importance of epidemic models in understanding and predicting disease spread and in assessing the effectiveness of interventions. The overarching topic of this thesis is stochastic epidemic modelling, with the main focus on the role of the underlying social structure in infectious disease spread.

In Paper I we study the spread of stochastic SIR-epidemics on an extended version of the configuration model with group structure. We present expressions for the basic reproduction number R0, the probability of a major outbreak and the expected final size, and investigate random vaccination with a perfect vaccine. We weaken the assumptions of earlier results for epidemics on this type of graph by allowing for heterogeneous infectivity both in individual infectivity and between different kinds of edges. An important special case of this model is the spread of a disease with arbitrary infectious period distribution in continuous time. 

Paper II concerns multi-type competition in a  variant of  Pólya's urn model with interaction, where balls of different colours/types annihilate upon contact. The model dynamics are governed by the structure of an underlying graph. In the special case of a cycle graph, this urn model is equivalent to a planar growth model with competing pathogens. It has earlier been shown that in the two-type case, indefinite coexistence has probability 0 for any (finite and connected) underlying graph, while for K ≥ 3 types the possibility of coexistence depends on the structure of this graph. We show that for K ≥ 3 types competing on a cycle graph, there is with probability 1 eventually only one remaining type.

In Paper III we study the real-time growth rate of SIR epidemics on random intersection graphs with mixed Poisson degree distribution. We show that during the early stage of the epidemic, the number of infected individuals grows exponentially and the Malthusian parameter is shown to satisfy a  version of the Euler-Lotka equation. These results are obtained via an approximating embedded single-type Crump-Mode-Jagers branching process. In addition, we provide a lower bound on the cumulative number of individuals that get infected before the branching process approximation breaks down. 

In Paper IV we consider stochastic SIR epidemics on inhomogeneous random graphs with degree-dependent contact rates. In this model, the per-neighbour contact rate of an individual decrease but its overall expected contact rate increases with its expected number of neighbours. We provide the basic reproduction number R0, the probability of a large outbreak and the final size of an epidemic. We show that reducing heterogeneity in contact rates results in a higher value of the basic reproduction number R0, and demonstrate that this result does not generally extend to the probability of a major outbreak and the final size.

Place, publisher, year, edition, pages
Stockholm: Department of Mathematics, Stockholm University , 2023. , p. 36
Keywords [en]
random graphs, branching processes, SIR epidemics, malthusian parameter, urn model
National Category
Probability Theory and Statistics
Research subject
Mathematical Statistics
Identifiers
URN: urn:nbn:se:su:diva-212974ISBN: 978-91-8014-144-4 (print)ISBN: 978-91-8014-145-1 (electronic)OAI: oai:DiVA.org:su-212974DiVA, id: diva2:1720143
Public defence
2023-02-10, Lecture room 4, 2nd floor, house 1, Albano, Albanovägen 28, Stockholm, 13:00 (English)
Opponent
Supervisors
Funder
Swedish Research Council, 2016-04566Available from: 2023-01-18 Created: 2022-12-17 Last updated: 2023-01-11Bibliographically approved
List of papers
1. SIR epidemics and vaccination on random graphs with clustering
Open this publication in new window or tab >>SIR epidemics and vaccination on random graphs with clustering
2019 (English)In: Journal of Mathematical Biology, ISSN 0303-6812, E-ISSN 1432-1416, Vol. 78, no 7, p. 2369-2398Article in journal (Refereed) Published
Abstract [en]

In this paper we consider Susceptible Infectious Recovered (SIR) epidemics on random graphs with clustering. To incorporate group structure of the underlying social network, we use a generalized version of the configuration model in which each node is a member of a specified number of triangles. SIR epidemics on this type of graph have earlier been investigated under the assumption of homogeneous infectivity and also under the assumption of Poisson transmission and recovery rates. We extend known results from literature by relaxing the assumption of homogeneous infectivity both in individual infectivity and between different kinds of neighbours. An important special case of the epidemic model analysed in this paper is epidemics in continuous time with arbitrary infectious period distribution. We use branching process approximations of the spread of the disease to provide expressions for the basic reproduction number R0, the probability of a major outbreak and the expected final size. In addition, the impact of random vaccination with a perfect vaccine on the final outcome of the epidemic is investigated. We find that, for this particular model, R0 equals the perfect vaccine-associated reproduction number. Generalizations to groups larger than three are discussed briefly.

Keywords
SIR epidemics, Configuration model, Clustering, Branching processes, Vaccination
National Category
Biological Sciences
Identifiers
urn:nbn:se:su:diva-170123 (URN)10.1007/s00285-019-01347-2 (DOI)000468977100012 ()30972440 (PubMedID)
Available from: 2019-06-27 Created: 2019-06-27 Last updated: 2022-12-17Bibliographically approved
2. Multi-colour competition with reinforcement
Open this publication in new window or tab >>Multi-colour competition with reinforcement
(English)Manuscript (preprint) (Other academic)
Abstract [en]

We study a system of interacting urns where balls of different colour/type compete for their survival, and annihilate upon contact. For competition between two types, the underlying graph (finite and connected), determining the interaction between the urns, is known to be irrelevant for the possibility of coexistence, whereas for $K\geq 3$ types the structure of the graph does affect the possibility of coexistence. We show that when the underlying graph is a cycle, competition between $K\geq 3$ types almost surely has a single survivor, thus establishing a conjecture of Griffiths, Janson, Morris and the first author. Along the way, we give a detailed description of an auto-annihilative process on the cycle, which can be perceived as an expression of the geometry of a Möbius strip in a discrete setting.

Keywords
urn model, reinforcement process, coexistence, spatial growth
National Category
Probability Theory and Statistics
Research subject
Mathematical Statistics
Identifiers
urn:nbn:se:su:diva-212969 (URN)
Available from: 2022-12-16 Created: 2022-12-16 Last updated: 2022-12-17
3. The real-time growth rate of stochastic epidemics on random intersection graphs
Open this publication in new window or tab >>The real-time growth rate of stochastic epidemics on random intersection graphs
(English)Manuscript (preprint) (Other academic)
Abstract [en]

This paper is concerned with the growth rate of SIR (Susceptible-Infectious-Recovered) epidemics with general infectious period distribution on random intersection graphs. This type of graph is characterized by the presence of cliques (fully connected subgraphs). We study epidemics on random intersection graphs with a mixed Poisson degree distribution and show that in the limit of large population sizes the number of infected individuals grows exponentially during the early phase of the epidemic, as is generally the case for epidemics on asymptotically unclustered networks. The Malthusian parameter is shown to satisfy a variant of the classical Euler-Lotka equation. To obtain these results we construct a coupling of the epidemic process and a continuous-time multitype branching process, where the type of an individual is (essentially) given by the length of its infectious period. Asymptotic results are then obtained via an embedded single-type Crump-Mode-Jagers branching process. 

Keywords
SIR epidemic, Random Intersection graph, Cliques, Branching process approximation, Malthusian parameter, Regenerative branching process
National Category
Probability Theory and Statistics
Research subject
Mathematical Statistics
Identifiers
urn:nbn:se:su:diva-212970 (URN)
Available from: 2022-12-16 Created: 2022-12-16 Last updated: 2022-12-17
4. Stochastic epidemics on inhomogenous random graphs with degree-dependent contact rates
Open this publication in new window or tab >>Stochastic epidemics on inhomogenous random graphs with degree-dependent contact rates
(English)Manuscript (preprint) (Other academic)
Abstract [en]

We consider a stochastic SIR epidemic on an inhomogeneous random graph. In most models for epidemics on networks, the (possibly stochastic) processes that describe the contacts between individuals follow the same law for every pair of neighbours and are therefore independent of the degrees of the individuals. In this paper, we investigate the impact of this simplifying assumption. To this end, we consider a model where the contact rate between two neigbours depends on their degrees. We make assumptions that, heuristically, ensure that the per-neighbour contact rates of an individual decrease with the expected number of neighbours of that individual. We investigate the basic reproduction number $R_0$, the probability of a large outbreak, and the final size of an epidemic. We show that reducing heterogeneity in contacts (while keeping the average total contact intensity fixed) leads to an increase in the basic reproduction number $R_0$. In particular,  ignoring heterogeneity in interactions by assuming that contact rates are constant results in a higher value of $R_0$. Similar inequalities do not exist in general for the probability of a large outbreak and the final size of an epidemic.

Keywords
Inhomogeneous random graphs, degree dependent infectivity, contact heterogeneity, coital dilution
National Category
Probability Theory and Statistics
Research subject
Mathematical Statistics
Identifiers
urn:nbn:se:su:diva-212972 (URN)
Available from: 2022-12-17 Created: 2022-12-17 Last updated: 2022-12-17

Open Access in DiVA

Stochastic epidemics on random networks and competition in growth(917 kB)311 downloads
File information
File name FULLTEXT01.pdfFile size 917 kBChecksum SHA-512
1ae0697d9a28fbed55570aa5ed9bef8d641f07005f276eb72d1ee2752ba3cba9b41b508e516e7f15963dd441f5777d7a02b6e2d3d223e25cba1b4bf081db4eba
Type fulltextMimetype application/pdf

Authority records

Fransson, Carolina

Search in DiVA

By author/editor
Fransson, Carolina
By organisation
Department of Mathematics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 318 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 776 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf