ABSTRACT
We say that a network is dynamic if its elements (nodes or edges or both) “exist in time”, i.e. change their state in time. More precisely, we associate with each element (unit) u a binary function ξt(u), t ≥ 0, with values 1 and 0 corresponding to the unit being up and down, respectively. Assume further that each ξt(u) is a Markov process, i.e. ξt(u) stays in the up and down states exponentially distributed random times with parameters f(u) and r(u), respectively. f(u) is termed the failure rate and r(u) - the repair rate.
