Metraipolis › archive › dc_1beaeca0d856
A Few Shared Random Bits Suffice for Constant-Round Almost Stable Matching — arXiv:2608.24102
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24102
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T06:21:52.899Z
- SHA-256 of the archived text
0622125237734a77de8c18691682967a0dfc88e5f713e3819262e791e164ba71- Stable URL of this page
https://metraipolis.com/documento/dc_1beaeca0d856
How to cite
A Few Shared Random Bits Suffice for Constant-Round Almost Stable Matching — arXiv:2608.24102 — arXiv (en), https://arxiv.org/abs/2608.24102 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1beaeca0d856 (Metraipolis archive dc_1beaeca0d856, sha256 0622125237734a77de8c18691682967a0dfc88e5f713e3819262e791e164ba71)
BibTeX
@misc{dc1beaeca0d856,
title = {A Few Shared Random Bits Suffice for Constant-Round Almost Stable Matching — arXiv:2608.24102},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24102},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1beaeca0d856; sha256 0622125237734a77de8c18691682967a0dfc88e5f713e3819262e791e164ba71},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24102. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that almost stable matching can be solved in constant distributed rounds on general bipartite graphs $G=(V,E)$ using only a few shared random bits. Specifically, in the $\congest$ model, we compute a matching whose expected number of blocking pairs is at most $\varepsilon |E|$ in $O\left(\frac{\log(1/\varepsilon)}{\varepsilon^4}\right)$ rounds using $O\left(\log(1/\varepsilon)\right)$ shared random bits. Thus, for every constant $\varepsilon>0$, the round complexity is $O(1)$, independent of the number of vertices and the maximum degree. Previous algorithms achieve constant round complexity only for bounded-degree or almost-regular graphs; on general graphs, their round complexity depends polylogarithmically on $n$. Our main technical idea is a degree-guarded freezing rule that allows widely varying degrees to be handled by a single global charging argument, avoiding the $\Theta(\log n)$ successive degree thresholds used in previous work. The shared random bits are used only to select a common random output iteration. As consequences, we obtain an $O\left( \frac{\log(1/\varepsilon)}{\varepsilon^4} + \frac{\log n}{\varepsilon} \right)$-round $\congest$ algorithm without pre-shared randomness, via a low-diameter decomposition, and an $O\left(\frac{\log(1/\varepsilon)}{\varepsilon^4}\right)$-round algorithm in the fully-scalable Massively Parallel Computation ($\mpc$) model with linear total memory.
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-26 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.24102 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T06:17:57.829Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).