Sökning: onr:"swepub:oai:DiVA.org:su-25638" >
Epidemics on random...
Epidemics on random graphs with tunable clustering
-
- Britton, Tom (författare)
- Stockholms universitet,Matematiska institutionen
-
- Deijfen, Maria (författare)
- Stockholms universitet,Matematiska institutionen
-
- Lagerås, Andreas N (författare)
- Stockholms universitet,Matematiska institutionen
-
visa fler...
-
- Lindholm, Mathias (författare)
- Stockholms universitet,Matematiska institutionen
-
visa färre...
-
(creator_code:org_t)
- 2016-07-14
- 2008
- Engelska.
-
Ingår i: Journal of Applied Probability. - : Cambridge University Press (CUP). - 0021-9002 .- 1475-6072. ; 45:3, s. 743-756
- Relaterad länk:
-
https://www.cambridg...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- In this paper a branching process approximation for the spread of a Reed-Frost epidemic on a network with tunable clustering is derived. The approximation gives rise to expressions for the epidemic threshold and the probability of a large outbreak in the epidemic. We investigate how these quantities vary with the clustering in the graph and find that, as the clustering increases, the epidemic threshold decreases. The network is modeled by a random intersection graph, in which individuals are independently members of a number of groups and two individuals are linked to each other if and only if there is at least one group that they are both members of.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- Epidemics; random graph; clustering; branching process; epidemic threshold
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas