Distributed conductance testing in the CONGEST model, implementing and benchmarking Fichtenberger–Vasudev (2018) and Batu–Trehan–Trehan (2023) random-walk testers, with count-aggregated simulation and an experiment suite that tests each algorithm on smaller graph sizes (practical to run on my machine, at least).
algorithms networkx graph-theory property-testing distributed-algorithms conductance graph-networks spectral-graph-theory directed-studies random-walks algorithms-research congest-model
-
Updated
Oct 7, 2026 - Python