Pith. sign in

REVIEW 1 cited by

Occam Factor for Random Graphs: Erd\"{o}s-R\'{e}nyi, Independent Edge, and Rank-1 Stochastic Blockmodel

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.06465 v4 pith:IMJ4LCQP submitted 2023-05-10 stat.ME

Occam Factor for Random Graphs: Erd\"{o}s-R\'{e}nyi, Independent Edge, and Rank-1 Stochastic Blockmodel

classification stat.ME
keywords modelevidencemodelsparadigmrank-1appropriateblockmodelcandidate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We investigate the evidence/flexibility (i.e., "Occam") paradigm and demonstrate the theoretical and empirical consistency of Bayesian evidence for the task of determining an appropriate generative model for network data. This model selection framework involves determining a collection of candidate models, equipping each of these models' parameters with prior distributions derived via the encompassing priors method, and computing or approximating each models' evidence. We demonstrate how such a criterion may be used to select the most suitable model among the Erd\"{o}s-R\'{e}nyi (ER) model, independent edge (IE) model, and rank-1 stochastic blockmodel (SBM). The Erd\"{o}s-R\'{e}nyi may be considered as being linearly nested within IE, a fact which permits exponential family results. The rank-1 SBM is not so ideal, so we propose a numerical method to approximate its evidence. We apply this paradigm to brain connectome data. Future work necessitates deriving and equipping additional candidate random graph models with appropriate priors so they may be included in the paradigm.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Bayesian Predictive Synthesis for Dynamic Networks: Forecasting and Identifying Structural Mechanisms

    cs.SI 2026-06 unverdicted novelty 6.0

    Dynamic Bayesian predictive synthesis combines forecasts from multiple network mechanisms with time-varying weights for adaptive edge prediction and mechanism identification in dynamic networks.