On the evolution of topology in dynamic clique complexes

Abstract

We consider a time varying analogue of the Erd os-R\' enyi 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 normalized k-th Betti number of these dynamic clique complexes converges weakly to the Ornstein-Uhlenbeck process as n ∞.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…