Reproduce “Regular decomposition of large graphs and other structures: scalability and robustness towards missing data” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Hannu Reittu, Ilkka Norros, Fülöp Bazsó
RD assigns nodes in a graph by learning groups and link densities from a small sample, then comparing nodes’ links to those groups. It uses minimum description length to select a partition and density model. In a stochastic block model with 20 groups, no errors were observed for samples larger than 200; this finding assumes the sample partition is correct.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.