The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models

L. Gunderson, Gecia Bravo Hermsdorff, Peter Orbanz
2/1/2024

No confident code implementation found for this paper.

Abstract

In this work, we describe a method that determines an exact map from a finite set of subgraph densities to the parameters of a stochastic block model (SBM) matching these densities. Given a number $K$ of blocks, the subgraph densities of a finite number of stars and bistars uniquely determines a single element of the class of all degree-separated stochastic block models with $K$ blocks. Our method makes it possible to translate estimates of these subgraph densities into model parameters, and hence to use subgraph densities directly for inference. The computational overhead is negligible; computing the translation map is polynomial in $K$, but independent of the graph size once the subgraph densities are given.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{gunderson2024graph,
  title  = {The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models},
  author = {L. Gunderson and Gecia Bravo Hermsdorff and Peter Orbanz},
  year   = {2024},
  eprint = {2402.00188},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2402.00188},
  url    = {https://arxiv.org/abs/2402.00188},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.00188.svg)](https://codeofpaper.com/paper/2402.00188)

Discussion