English

On the evolution of topology in dynamic clique complexes

Probability 2016-01-18 v3

Abstract

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 p=nαp = n^\alpha, where nn is the number of vertices and α(1/k,1/(k+1)),\alpha \in (-1/k, -1/(k + 1)), then the process of the normalized kk-th Betti number of these dynamic clique complexes converges weakly to the Ornstein-Uhlenbeck process as n.n \to \infty.

Keywords

Cite

@article{arxiv.1503.01983,
  title  = {On the evolution of topology in dynamic clique complexes},
  author = {Gugan Thoppe and D. Yogeshwaran and Robert Adler},
  journal= {arXiv preprint arXiv:1503.01983},
  year   = {2016}
}

Comments

Rewrote the introduction

R2 v1 2026-06-22T08:46:10.127Z