A Markov Model for Inferring Flows in Directed Contact Networks

  • Steve HuntsmanEmail author
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 812)


Directed contact networks (DCNs) are a particularly flexible and convenient class of temporal networks, useful for modeling and analyzing the transfer of discrete quantities in communications, transportation, etc. Transfers modeled by contacts typically underlie flows that associate multiple contacts based on their spatiotemporal relationships. To infer these flows, we introduce a simple inhomogeneous Markov model associated to a DCN and show how it can be effectively used for data reduction and anomaly detection through an example of kernel-level information transfers within a computer.


Temporal networks Markov model 



The author thanks Yingbo Song, Rob Ross, and Mike Weber for many helpful discussions as well as creating the summary and ground truth data used in Sect. 4, and George Cybenko for still more helpful discussions. This material is based upon work supported by the Defense Advanced Research Projects Agency (DARPA) and the Air Force Research Laboratory (AFRL). Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of DARPA or AFRL.


  1. 1.
    Brémaud, P.: Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. Springer, Berlin (1999)Google Scholar
  2. 2.
    Chan, S.C., et al.: Expressiveness benchmarking for system-level provenance. In: TaPP (2017)Google Scholar
  3. 3.
    Grindrod, P., Higham, D.J.: A matrix iteration for dynamic network summaries. SIAM Rev. 55, 118 (2013)Google Scholar
  4. 4.
    Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88, 234 (2015)Google Scholar
  5. 5.
    Huntsman, S.: Topological mixture estimation. In: ICML (2018)Google Scholar
  6. 6.
    Jenkinson, G., et al.: Applying provenance in APT monitoring and analysis. In: TaPP (2017)Google Scholar
  7. 7.
    King, S.T., Chen, P.M.: Backtracking intrusions. ACM Trans. Comput. Syst. 23, 51 (2005)Google Scholar
  8. 8.
    Lencastre, P., et al.: From empirical data to continuous Markov processes: a systematic approach. Phys. Rev. E 93, 032135 (2016)Google Scholar
  9. 9.
    Masuda, N., Lambiotte, R.: A Guide to Temporal Networks. World Scientific, Singapore (2016)Google Scholar
  10. 10.
    Meilă, M.: Comparing clusterings-an information based distance. J. Multivar. Anal. 98, 873 (2007)Google Scholar
  11. 11.
    Perra, N., et al.: Random walks and search in time-varying networks. Phys. Rev. Lett. 109, 238701 (2012)Google Scholar
  12. 12.
    Ramsey, N.F.: Thermodynamics and statistical mechanics at negative absolute temperatures. Phys. Rev. 103, 20 (1956)Google Scholar
  13. 13.
    Rocha, L.E.C., Masuda, N.: Random walk centrality for temporal networks. New J. Phys. 16, 063023 (2014)Google Scholar
  14. 14.
    Saramäki, J., Holme, P.: Exploring temporal networks with greedy walks. Eur. Phys. J. B 88, 334 (2015)Google Scholar
  15. 15.
    Ser-Giacomi, E., et al.: Most probable paths in temporal weighted networks: an application to ocean transport. Phys. Rev. E 92, 012818 (2015)Google Scholar
  16. 16.
    Starnini, M., et al.: Random walks on temporal networks. Phys. Rev. E 85, 056115 (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.BAE Systems FAST LabsArlingtonUSA

Personalised recommendations