Epidemics on random graphs with tunable clustering

Details Epidemics on random graphs with tunable clustering Epidemics on random graphs with tunable clustering

2007-08-29

arxiv.org/abs/0708.3939v1

Mathematics

Probability

17 pages, 1 figure

Scientific paper

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. It is investigated how these quantities varies with the clustering in the graph and it turns out for instance that, as the clustering increases, the epidemic threshold decreases. The network is modelled 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 they share at least one group.

Affiliated with

Also associated with

No associations

Rating

Epidemics on random graphs with tunable clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Epidemics on random graphs with tunable clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Epidemics on random graphs with tunable clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240315