Epidemics on Random Graphs with Tunable Clustering

DOI10.1239/JAP/1222441827zbMATH Open1147.92034arXiv0708.3939OpenAlexW2137628825MaRDI QIDQ3535635FDOQ3535635

Authors: T. Britton, Maria Deijfen, M. Lindholm, Andreas Nordvall Lagerås 

Publication date: 13 November 2008

Published in: Journal of Applied Probability (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/0708.3939

Recommendations

• Epidemics on random intersection graphs
• How Clustering Affects Epidemics in Random Networks
• A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
• SIR epidemics and vaccination on random graphs with clustering
• scientific article; zbMATH DE number 2197804

zbMATH Keywords

clusteringbranching processepidemic threshold

Mathematics Subject Classification ID

Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85)

Cites Work

• The Structure and Function of Complex Networks
• On Random Intersection Graphs: The Subgraph Problem
• Stochastic epidemic models and their statistical analysis
• Epidemics with two levels of mixing
• Random graph dynamics
• Threshold limit theorems for some epidemic processes
• Title not available (Why is that?)
• The structure and dynamics of networks
• Title not available (Why is that?)
• On analytical approaches to epidemics on networks
• Multitype randomized Reed-Frost epidemics and epidemics upon random graphs
• The vertex degree distribution of random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Component evolution in random intersection graphs
• The final size and severity of a generalised stochastic multitype epidemic model
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Limit theorems for a random graph epidemic model
• Title not available (Why is that?)
• SIR epidemics on a Bernoulli random graph

Cited In (44)

• Degree distribution of an inhomogeneous random intersection graph
• The Early Stage Behaviour of a Stochastic SIR Epidemic with Term-Time Forcing
• Clustering for epidemics on networks: a geometric approach
• Pandemic spread in communities via random graphs
• Analysis of a stochastic SIR epidemic on a random network incorporating household structure
• Control strategies of contagion processes in time-varying networks
• Acquaintance vaccination in an epidemic on a random graph with specified degree distribution
• Modelling the spread of diseases in clustered networks
• Maximizing the size of the giant
• Degree and clustering coefficient in sparse random intersection graphs
• Edge exchangeable models for interaction networks
• Disease spread in small-size directed networks: epidemic threshold, correlation between links to and from nodes, and clustering
• Modelling disease spread through random and regular contacts in clustered populations
• Dynamics of epidemic spreading on connected graphs
• SIR epidemics on a scale-free spatial nested modular network
• Cluster approximations for epidemic processes: a systematic description of correlations beyond the pair level
• Multitype randomized Reed-Frost epidemics and epidemics upon random graphs
• Bounding the Size and Probability of Epidemics on Networks
• Law of large numbers for the SIR epidemic on a random graph with given degrees
• A coupled spatial-network model: a mathematical framework for applications in epidemiology
• Spreading properties for SIR models on homogeneous trees
• Phase transitions for detecting latent geometry in random graphs
• The shortest distance in random multi-type intersection graphs
• A Note on the Conductance of the Binomial Random Intersection Graph
• Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
• Epidemic prediction and control in clustered populations
• Random key predistribution for wireless sensor networks using deployment knowledge
• Assortativity and bidegree distributions on Bernoulli random graph superpositions
• Bifurcations in synergistic epidemics on random regular graphs
• Observability transitions in clustered networks
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Poisson approximation of the number of cliques in random intersection graphs
• Effective degree household network disease model
• Contagions in random networks with overlapping communities
• Threshold behaviour and final outcome of an epidemic on a random network with household structure
• A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
• How Clustering Affects Epidemics in Random Networks
• SIR epidemics and vaccination on random graphs with clustering
• Large-scale properties of clustered networks: implications for disease dynamics
• Epidemics on random intersection graphs
• Clustering and percolation on superpositions of Bernoulli random graphs
• Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
• A stochastic graph process for epidemic modelling
• The coupling method for inhomogeneous random intersection graphs.

This page was built for publication: Epidemics on Random Graphs with Tunable Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535635)