Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs

In this paper we consider two-opinion voter models on dynamic random graphs, in which the joint dynamics of opinions and graphs acts as one-way feedback, i.e., edges appear and disappear over time depending on the opinions of the two connected vertices, while the opinion dynamics is not affected by the graph structure. Our goal is to investigate the joint evolution of the entries of a voter subgraph count vector, i.e., vector of subgraphs where each vertex has a specific opinion, in the regime that the number of vertices grows large. The main result of this paper is a functional central limit theorem. In particular, we prove that, under a proper centering and scaling, the joint functional of the vector of subgraph counts converges to a specific multidimensional Gaussian process.