Constructing Stochastic Matrices for Weighted Averaging in Gossip Networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916633093603328 |
|---|---|
| author | Bayram, Erkan Belabbas, Mohamed-Ali |
| author_facet | Bayram, Erkan Belabbas, Mohamed-Ali |
| contents | The convergence of the gossip process has been extensively studied; however, algorithms that generate a set of stochastic matrices, the infinite product of which converges to a rank-one matrix determined by a given weight vector, have been less explored. In this work, we propose an algorithm for constructing (local) stochastic matrices based on a given gossip network topology and a set of weights for averaging across different consensus clusters, ensuring that the gossip process converges to a finite limit set. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19821 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constructing Stochastic Matrices for Weighted Averaging in Gossip Networks Bayram, Erkan Belabbas, Mohamed-Ali Optimization and Control Multiagent Systems The convergence of the gossip process has been extensively studied; however, algorithms that generate a set of stochastic matrices, the infinite product of which converges to a rank-one matrix determined by a given weight vector, have been less explored. In this work, we propose an algorithm for constructing (local) stochastic matrices based on a given gossip network topology and a set of weights for averaging across different consensus clusters, ensuring that the gossip process converges to a finite limit set. |
| title | Constructing Stochastic Matrices for Weighted Averaging in Gossip Networks |
| topic | Optimization and Control Multiagent Systems |
| url | https://arxiv.org/abs/2502.19821 |