The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models
Lee M. Gunderson, Gecia Bravo Hermsdorff, Peter Orbanz
摘要
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 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 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 , but independent of the graph size once the subgraph densities are given.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple GraphsIiro Kumpulainen, Sebastian Dalleiger, Jilles Vreeken, Nikolaj TattiAAAI 2025 · 被引用 1 次
- Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor GraphsElchanan Mossel, Allan Sly, Youngtak SohnSTOC 2025 · 被引用 3 次
- Sharp Phase Transitions in Estimation with Low-Degree PolynomialsYoungtak Sohn, Alexander S. WeinSTOC 2025 · 被引用 1 次
- Optimal Graph Clustering without Edge Density SignalsMaximilien Dreveton, Elaine Siyu Liu, Matthias Grossglauser, Patrick ThiranNeurIPS 2025
- Local Statistics, Semidefinite Programming, and Community DetectionJess Banks, Sidhanth Mohanty, Prasad RaghavendraSODA 2021 · 被引用 18 次
