“…W = [w i j ] ∈ R n×n is the adjacency matrix of G. Here, we only consider a graph G with no self-loops, i.e., w ii = 0, ∀ i ∈ V. We also confine ourselves that w i j > 0, ∀ i, j ∈ V, if there exists an edge from j to i. Then, the discrete-time dynamic model of the SIS model is [53] x (23) i ∈ V, where for each note i, x i (k) denotes its infection probability at time step k ∈ N ≥0 , d i ∈ R ≥0 is the proactive infection rate, δ i ∈ R ≥0 is the passive curing rate at instant k, and h ∈ R + is the sampling period. Under appropriate assumptions [54], the infection probability x i (k), for all k ∈ N ≥0 and i ∈ V, is well defined, i.e., given any initial condition x i (0) ∈ [ 0, 1 ], the system state is confined by x i (k) ∈ [ 0, 1 ].…”