Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.19630 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916966881558528 |
|---|---|
| author | Aghanya, Nnamdi Daniel |
| author_facet | Aghanya, Nnamdi Daniel |
| contents | Many networked systems require a central authority to enforce a global configuration against local peer influence. We study influence dynamics on finite weighted directed graphs with a distinguished hub node and binary vertex states ('Glory' or 'Gnash'). We give a sharp, local, and efficiently checkable criterion that guarantees global convergence to Glory in a single synchronous update from any initial state. At each non-hub vertex, the incoming weight from the hub must at least match the total incoming weight from all other nodes. Specialising in uniform hub broadcasts, the exact threshold equals the maximum non-hub incoming weight over all vertices, and we prove this threshold is tight. We extend the result to a tau-biased update rule and to asynchronous (Gauss-Seidel) schedules, where a single pass still suffices under the same domination hypothesis. Machine-checked proofs in Coq accompany all theorems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_19630 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Heaven & Hell: One-Step Hub Consensus Aghanya, Nnamdi Daniel Social and Information Networks 05C82, 05C20, 05C22, 68Q25, 93A14 F.2.2; G.2.2; C.2.4 Many networked systems require a central authority to enforce a global configuration against local peer influence. We study influence dynamics on finite weighted directed graphs with a distinguished hub node and binary vertex states ('Glory' or 'Gnash'). We give a sharp, local, and efficiently checkable criterion that guarantees global convergence to Glory in a single synchronous update from any initial state. At each non-hub vertex, the incoming weight from the hub must at least match the total incoming weight from all other nodes. Specialising in uniform hub broadcasts, the exact threshold equals the maximum non-hub incoming weight over all vertices, and we prove this threshold is tight. We extend the result to a tau-biased update rule and to asynchronous (Gauss-Seidel) schedules, where a single pass still suffices under the same domination hypothesis. Machine-checked proofs in Coq accompany all theorems. |
| title | Heaven & Hell: One-Step Hub Consensus |
| topic | Social and Information Networks 05C82, 05C20, 05C22, 68Q25, 93A14 F.2.2; G.2.2; C.2.4 |
| url | https://arxiv.org/abs/2509.19630 |