The infection time of graphs
DOI10.1016/J.DAM.2006.04.026zbMATH Open1119.60079OpenAlexW1974210749MaRDI QIDQ858307FDOQ858307
Authors: Tassos Dimitriou, Sotiris E. Nikoletseas, P. G. Spirakis 
Publication date: 9 January 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.026
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
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)
Cites Work
- Title not available (Why is that?)
- Markov Chains
- Eigenvalues and expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to withstand mobile virus attacks (extended abstract)
- Collisions Among Random Walks on a Graph
- Attack propagation in networks
- Title not available (Why is that?)
- Fast information sharing in a complete network
- Distributed communication algorithms for ad hoc mobile networks.
- Spreading rumors rapidly despite an adversary
- Title not available (Why is that?)
Cited In (16)
- Spread of information and diseases via random walks in sparse graphs
- Viral processes by random walks on random regular graphs
- Permutation Tests for Infection Graphs
- Finite particle systems and infection models
- Random walks in random conductances: decoupling and spread of infection
- Infection spread in random geometric graphs
- Exact computation for meeting times and infection times of random walks on graphs
- Information spreading in dynamic networks: an analytical approach
- Spread of epidemics and rumours with mobile agents
- Information spreading in dynamic graphs
- Title not available (Why is that?)
- Viral processes by random walks on random regular graphs
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- The P3 infection time is W[1]-hard parameterized by the treewidth
- Infection in hypergraphs
- The coalescing-branching random walk on expanders and the dual epidemic process
Uses Software
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)
