Infection Spread in Random Geometric Graphs
From MaRDI portal
Publication:5246176
DOI10.1239/aap/1427814586zbMath1337.60242OpenAlexW2081724238MaRDI QIDQ5246176
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
Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Characterization and structure theory of statistical distributions (62E10)
Related Items (5)
Concentration for Poisson functionals: component counts in random geometric graphs ⋮ Constrained minimum passage time in random geometric graphs ⋮ Migration–contagion processes ⋮ Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs ⋮ A computational framework for evaluating the role of mobility on the propagation of epidemics on point processes
Cites Work
- Exponential extinction time of the contact process on finite graphs
- Size of the giant component in a random geometric graph
- Disjoint crossings, positive speed and deviation estimates for first passage percolation
- Contact processes on random graphs with power law degree distributions have critical value 0
- Oriented percolation in two dimensions
- First-passage percolation on the square lattice
- Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
- Random Geometric Graphs
- Continuum Percolation
- Unnamed Item
- Unnamed Item
This page was built for publication: Infection Spread in Random Geometric Graphs