Papers
Topics
Authors
Recent
2000 character limit reached

On the evolution of topology in dynamic clique complexes

Published 5 Mar 2015 in math.PR | (1503.01983v3)

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\alpha$, where $n$ is the number of vertices and $\alpha \in (-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 \to \infty.$

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.