The averaging process on infinite graphs
Probability
2024-08-14 v1
Abstract
We consider the averaging process on an infinite connected graph with bounded degree and independent, identically distributed starting values or initial opinions. Assuming that the law of the initial opinion of a vertex has a finite second moment, we show that the opinions of all vertices converge in to the first moment of the law of the initial opinions. A key tool in the proof is the Sharing a drink procedure introduced by Olle H\"aggstr\"om.
Keywords
Cite
@article{arxiv.2408.06859,
title = {The averaging process on infinite graphs},
author = {Nina Gantert and Timo Vilkas},
journal= {arXiv preprint arXiv:2408.06859},
year = {2024}
}
Comments
11 pages