Fast Distributed MIS and Maximal Matching on Spatial and PLB-Bounded Scale-Free Networks: A Single-Event Meta-Theorem with Geometry and PLB-U/L/N
We prove an axiomatic meta-theorem yielding O(log log n)-round randomized algorithms for maximal independent set (MIS) and maximal matching on broad classes of scale-free networks. Our framework unifies two flavors: (i) geometry-driven rank-1 models (
Authors
- Ankit Chauhan (ORCID: https://orcid.org/0000-0003-2766-7422)
Institutions
- Infosys (India) (IN)
Publication Details
- Published
- 2025-10-14
- DOI
- https://doi.org/10.36227/techrxiv.176045769.91474608/v1
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00