Infection spread in random geometric graphs

DOI10.1239/AAP/1427814586MaRDI QIDQ5246176zbMATH OpenOpenAlexFDO

Authors Ghurumuruhan Ganesan

Publication date 17 April 2015

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.aap/1427814586

zbMATH Keywords

contact processinfection spreadrandom geometric graphsurvival time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Characterization and structure theory of statistical distributions (62E10) Epidemiology (92D30)

Recommendations

• Super-exponential extinction time of the contact process on random geometric graphs
• Percolation by cumulative merging and phase transition for the contact process on random graphs
• The infection time of graphs
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• Contact process on a graph with communities

Cites work

• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
• Contact processes on random graphs with power law degree distributions have critical value 0
• Continuum Percolation
• Disjoint crossings, positive speed and deviation estimates for first passage percolation
• Exponential extinction time of the contact process on finite graphs
• First-passage percolation on the square lattice
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• scientific article; zbMATH DE number 1350307 (Why is no real title available?)
• Oriented percolation in two dimensions
• Random Geometric Graphs
• Size of the giant component in a random geometric graph

Cited in

(12)

• Infection in hypergraphs
• A computational framework for evaluating the role of mobility on the propagation of epidemics on point processes
• Concentration for Poisson functionals: component counts in random geometric graphs
• Constrained minimum passage time in random geometric graphs
• Containing viral spread on sparse random graphs: bounds, algorithms, and experiments
• Contact process on a graph with communities
• Super-exponential extinction time of the contact process on random geometric graphs
• Permutation Tests for Infection Graphs
• Migration–contagion processes
• The contact process on scale-free geometric random graphs
• Spread of information and diseases via random walks in sparse graphs
• The infection time of graphs

This page was built for publication: Infection spread in random geometric graphs

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