What can be computed in average anonymous networks?

Joel Rybicki, Oleg Verbitsky, Maksim Zhukovskii

We study what deterministic distributed algorithms can compute on random input graphs in extremely weak models of distributed computing: all nodes are anonymous, and in each commun…