Percolation by cumulative merging and phase transition for the contact process on random graphs

DOI10.24033/ASENS.2307zbMath1364.60137arXiv1502.06982OpenAlexW1810228069MaRDI QIDQ2958453

No author found.

Publication date: 2 February 2017

Published in: Annales scientifiques de l'École normale supérieure (Search for Journal in Brave)

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

zbMATH Keywords

percolationrandom graphsinteracting particle systemscontact processcumulative merging techniquetessellation problems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43) Combinatorial aspects of tessellation and tiling problems (05B45) Continuous-time Markov processes on discrete state spaces (60J27) Time-dependent percolation in statistical mechanics (82C43)

Related Items (12)

Phase transitions for chase-escape models on Poisson-Gilbert graphs ⋮ Migration–contagion processes ⋮ Contact process on a dynamical long range percolation ⋮ Limiting shape for first-passage percolation models on random geometric graphs ⋮ Chase–escape in dynamic device-to-device networks ⋮ Interacting particle systems ⋮ Exponential extinction time of the contact process on rank-one inhomogeneous random graphs ⋮ Survival and extinction of epidemics on random graphs with general degree ⋮ Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs ⋮ Exponential rate for the contact process extinction time ⋮ An overview of epidemic models with phase transitions to absorbing states running on top of complex networks ⋮ A computational framework for evaluating the role of mobility on the propagation of epidemics on point processes

This page was built for publication: Percolation by cumulative merging and phase transition for the contact process on random graphs