2 papers
math.PR2007
A note on the component structure in random intersection graphs with tunable clustering
Andreas Nordvall Lagerås, Mathias Lindholm
We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of…
math.PR2007
Epidemics on random graphs with tunable clustering
Tom Britton, Maria Deijfen, Andreas Nordvall Lagerås +1
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 expression…