arXiv (All)
open access
Consensus times for monotone aggregation dynamics
We study an asynchronous consensus dynamics on $N$ agents: at each step a uniformly chosen agent replaces its state by $f(Y_1,\dots,Y_r)$, where $f$ is a fixed monotone aggregation rule and $Y_1,\dots,Y_r$ are the states of $r$ agents sampled uniformly with replacement. Let $T$ be the first time at
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Redundancy Protects Human Collaborations from Failure#1159828
- Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks#1084857
- Online Multi-Level Aggregation with Per-Batch Maximum Delay#999842
- Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities#1144694
- Almost sure one-endedness of a random graph model of distributed ledgers#798535
Record · ID 927756
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive