Continuous-Time Independent Edge-Markovian Random Graph Process  

作　　者：Ruijie DU Hanxing WANG Yunbin FU 

机构地区：[1]Department of Mathematics, Shanghai University [2]School of Mathematics and Information, Shanghai Lixin University of Commerce

出　　处：《Chinese Annals of Mathematics,Series B》2016年第1期73-82,共10页数学年刊（B辑英文版）

基　　金：supported by the National Natural Science Foundation of China(Nos.60872060,11101265);the Shanghai Natural Science Foundation of China(No.12ZR1421000);the Shanghai Education Commission Innovation Project Fund(Nos.12ZZ193,14YZ152,15ZZ099)

摘　　要：In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.

关 键 词：Complex networks Random graph Random graph process Stationary distribution Independent edge-Markovian random graph process 

分 类 号：O211.62[理学—概率论与数理统计]