• DocumentCode
    177822
  • Title

    Subgraph density and epidemics over networks

  • Author

    June Zhang ; Moura, Jose M. F.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    2014
  • fDate
    4-9 May 2014
  • Firstpage
    1125
  • Lastpage
    1129
  • Abstract
    We model a SIS (susceptible-infected-susceptible) epidemics over a static, finite-sized network as a continuous-time Markov process using the scaled SIS epidemics model. In our previous work, we derived the closed form description of the equilibrium distribution that explicitly accounts for the network topology and showed that the most probable equilibrium state demonstrates threshold behavior. In this paper, we will show how subgraph structures in the network topology impact the most probable state of the long run behavior of a SIS epidemics (i.e., stochastic diffusion process) over any static, finite-sized, network.
  • Keywords
    Markov processes; epidemics; graph theory; network topology; continuous-time Markov process; equilibrium distribution; finite-sized network; network topology; scaled SIS epidemics model; static network; subgraph density; subgraph structures; susceptible-infected-susceptible epidemics; Acoustics; Additives; Conferences; Markov processes; Network topology; Speech; Topology; Reversible Markov process; SIS epidemics; densest subgraph; equilibrium distribution; graph density; k-densest subgraph; networks; topology dependent random interaction model;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on
  • Conference_Location
    Florence
  • Type

    conf

  • DOI
    10.1109/ICASSP.2014.6853772
  • Filename
    6853772