Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50) Continuous-time Markov processes on general state spaces (60J25) Continuous-time Markov processes on discrete state spaces (60J27) Interacting particle systems in time-dependent statistical mechanics (82C22)
Recommendations
- On infection in hypergraphs
- Infection in hypergraphs
- Infection spread in random geometric graphs
- Spread of infection over P.A. random graphs with edge insertion
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree
- Susceptible-infected epidemics on evolving graphs
- On an epidemic model on finite graphs
- Exact computation for meeting times and infection times of random walks on graphs
- Dynamics of epidemic spreading on connected graphs
Cites work
- scientific article; zbMATH DE number 1350307 (Why is no real title available?)
- scientific article; zbMATH DE number 524141 (Why is no real title available?)
- scientific article; zbMATH DE number 2006659 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- Attack propagation in networks
- Collisions Among Random Walks on a Graph
- Distributed communication algorithms for ad hoc mobile networks.
- Eigenvalues and expanders
- Fast information sharing in a complete network
- How to withstand mobile virus attacks (extended abstract)
- Markov Chains
- Spreading rumors rapidly despite an adversary
Cited in
(15)- Permutation Tests for Infection Graphs
- Viral processes by random walks on random regular graphs
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- Infection in hypergraphs
- Finite particle systems and infection models
- Information spreading in dynamic networks: an analytical approach
- Spread of information and diseases via random walks in sparse graphs
- Exact computation for meeting times and infection times of random walks on graphs
- Infection spread in random geometric graphs
- Spread of epidemics and rumours with mobile agents
- Viral processes by random walks on random regular graphs
- Random walks in random conductances: decoupling and spread of infection
- The coalescing-branching random walk on expanders and the dual epidemic process
- scientific article; zbMATH DE number 5931630 (Why is no real title available?)
- The P3 infection time is W[1]-hard parameterized by the treewidth
This page was built for publication: The infection time of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858307)
