Continuous-Time Independent Edge-Markovian Random Graph Process

In this paper, the continuous-time independent edge-Markovian randomgraph process model is constructed. The authors also define theinterval isolated nodes of the random graph process, study thedistribution sequence of the number of isolated nodes and theprobability of having no isolated nodes when the initialdistribution of the random graph process is stationary distribution,derive the lower limit of the probability in which two arbitrarynodes are connected and the random graph is also connected, andprove that the random graph is almost everywhere connected when thenumber of nodes is sufficiently large.