Skip to main content

Random Malware Propagation: Interacting Markov Processes

  • Chapter
  • First Online:
  • 729 Accesses

Part of the book series: Compact Textbooks in Mathematics ((CTM))

Abstract

In contrast to the preceding chapters, where we considered the propagation of wanted messages over the telecommunication system, we now turn to the propagation of unwanted ones, e.g., of malware . We introduce, on the set Φ = (X i)iI of all the device locations, a time-dependent Markovian model of the set of infected devices, evolving in time as a stochastic process. The main random mechanism that drives this infection process has two elements: (1) each device that has an infected neighbor is also infected after an exponentially distributed random time, and (2) any infected device either remains infected, or it undergoes a spontaneous healing, or it becomes patched by some neighboring device of another type, again after independent exponentially distributed random times.

This is a preview of subscription content, log in via an institution.

Buying options

eBook
USD   19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The definition of separability of a Markov chain is very technical; it ensures that the paths tω(t) are not too ‘wild’. We decided not to give this definition here.

  2. 2.

    Then the collection of these transition probabilities is called standard .

References

  1. W.J. Anderson, Continuous-Time Markov Chains: An Applications-Oriented Approach, Springer, New York, (2012).

    Google Scholar 

  2. C. Bezuidenhout and G. Grimmett, The critical contact process dies out, Ann. Probab.18, 1462–1482 (1990).

    Article  MathSciNet  Google Scholar 

  3. J.T. Cox and R. Durrett, Some limit theorems for percolation processes with necessary and sufficient conditions, Ann. Probab.9, 583–603 (1981).

    Article  MathSciNet  Google Scholar 

  4. R. Durrett, Lecture Notes on Particle Systems and Percolation, Brooks/Cole Pub Co (1988).

    Google Scholar 

  5. R. Durrett and D. Griffeath, Contact processes in several dimensions, Probab. Theory Relat. Fields49:4, 535–552 (1982).

    Google Scholar 

  6. R. Durrett, M. Junge and S. Tang, Coexistence in chase-escape, Electron. Commun. Probab.25:14 (2020).

    Google Scholar 

  7. O. Häggström and R. Pemantle, Absence of mutual unbounded growth for almost all parameter values in the two-type Richardson model, Stoch. Process. Their Appl.90:2, 207–222 (2000).

    Google Scholar 

  8. E. Cali, A. Hinsen, B. Jahnel and J.-P. Wary, Phase transitions for chase-escape models on Poisso–Gilbert graphs, Electron. Commun. Probab.25:25 (2020).

    Google Scholar 

  9. G. Kordzakhia, The escape model on a homogeneous tree, Electron. J. Probab.10, 113–124 (2005).

    Article  MathSciNet  Google Scholar 

  10. T.M. Liggett, Interacting Particle Systems, Springer, New York (1985).

    Book  Google Scholar 

  11. T.M. Liggett, Continuous Time Markov Processes: An Introduction, Volume 113 Graduate Studies in Mathematics, AMS (2010).

    Google Scholar 

  12. T.M. Liggett, Stochastic Interacting Systems: Contact, Voter and Exclusion Processes, Volume 324 Springer, New York (2013).

    MATH  Google Scholar 

  13. L. Ménard and A. Singh, Percolation by cumulative merging and phase transition for the contact process on random graphs, Ann. Sci. Éc. Norm. Supér. (4)49:5, 1189–1238 (2016).

    Google Scholar 

  14. R. Pemantle, The contact process on trees, Ann. Probab.20:4, 2089–2116 (1992).

    Google Scholar 

  15. M.D. Penrose, On a continuum percolation model, Adv. Appl. Probab.23:3, 536–556 (1991).

    Google Scholar 

  16. D. Richardson, Random growth in a tessellation, Math. Proc. Camb. Philos. Soc.74:3, 515–528 (1973).

    Google Scholar 

  17. D. Valesin, Multitype contact process on \(\mathbb {Z}\): extinction and interface, Electron. J. Probab.15, 2220–2260 (2010).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Jahnel, B., König, W. (2020). Random Malware Propagation: Interacting Markov Processes. In: Probabilistic Methods in Telecommunications. Compact Textbooks in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-36090-0_8

Download citation

Publish with us

Policies and ethics