加载中…
We consider a time varying analogue of the Erd{\H o}s-R{' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve independently as continuous time Markov chains. Our main result is that when the edge inclusion probability is of the form , where is the number of vertices and then the process of the normalized th Betti number of these dynamic clique complexes converges weakly to the Ornstein-Uhlenbeck process as

生成讲解博客的中文版本

生成AI智能校验的中文版本