Article contents
On the evolution of topology in dynamic clique complexes
Published online by Cambridge University Press: 11 January 2017
Abstract
We consider a time varying analogue of the Erdős–Ré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α, where n is the number of vertices and α∈(-1/k, -1/(k + 1)), then the process of the normalised kth Betti number of these dynamic clique complexes converges weakly to the Ornstein–Uhlenbeck process as n→∞.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 2017
References
- 5
- Cited by