Reproduce “VoG: Summarizing and Understanding Large Graphs” 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
Danai Koutra, U Kang, Jilles Vreeken, Christos Faloutsos
VoG describes large graphs with six subgraph shapes: full or near cliques, full or near bipartite cores, stars, and chains. It uses Minimum Description Length to select overlapping structures that minimize encoding costs for the summary and residual errors, using heuristics rather than exhaustive optimization. On Wikipedia Controversy, Greedy’nForget reaches 87% of baseline cost but leaves 31% of edges unexplained.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.