Centered and scaled subgraph count vectors in the voter model on dynamic random graphs converge to a multidimensional Gaussian process as the number of vertices tends to infinity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs
Centered and scaled subgraph count vectors in the voter model on dynamic random graphs converge to a multidimensional Gaussian process as the number of vertices tends to infinity.