EPIDEMICS ON RANDOM GRAPHS WITH TUNABLE CLUSTERING

被引：66

作者：

Britton, Tom ^{[1
]}

Deijfen, Maria ^{[1
]}

Lageras, Andreas N. ^{[1
]}

Lindholm, Mathias ^{[1
]}

机构：

[1] Stockholm Univ, Dept Math, S-10691 Stockholm, Sweden

来源：

JOURNAL OF APPLIED PROBABILITY | 2008年 / 45卷 / 03期

关键词：

Epidemics; random graph; clustering; branching process; epidemic threshold;

D O I：

10.1239/jap/1222441827

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

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.

引用

页码：743 / 756

页数：14

共 22 条

[1]

Andersson H, 1998, ANN APPL PROBAB, V8, P1331

[2]

ANDERSSON H, 2000, EPIDEMIC MODELS THEI

[3]

Athreya K. B., 1972, Branching Processes, DOI DOI 10.1007/978-3-642-65371-1

[4] THE FINAL SIZE AND SEVERITY OF A GENERALIZED STOCHASTIC MULTITYPE EPIDEMIC MODEL [J].

BALL, F ;

CLANCY, D .

ADVANCES IN APPLIED PROBABILITY, 1993, 25 (04) :721-736

[5]

Ball F, 1997, ANN APPL PROBAB, V7, P46

[6]

Behrisch M, 2007, ELECTRON J COMB, V14

[7]

DEIJFEN M, 2007, RANDOM INTERSE UNPUB

[8] Evolution of networks [J].

Dorogovtsev, SN ;

Mendes, JFF .

ADVANCES IN PHYSICS, 2002, 51 (04) :1079-1187

[9]

Durrett R, 2006, RANDOM GRAPH DYNAMIC

[10]

Fill JA, 2000, RANDOM STRUCT ALGOR, V16, P156, DOI 10.1002/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO

← 1 2 3 →