Pith. sign in

REVIEW

Stochastic Block Models are a Discrete Surface Tension

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 1806.02485 v2 pith:FETAQVCS submitted 2018-06-07 cs.SI cond-mat.stat-mechmath.STnlin.AOstat.MLstat.TH

classification cs.SIcond-mat.stat-mechmath.STnlin.AOstat.MLstat.TH
keywords networkmodelsnetworksblockcommunitiesconnectionsstochasticstructure
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Networks, which represent agents and interactions between them, arise in myriad applications throughout the sciences, engineering, and even the humanities. To understand large-scale structure in a network, a common task is to cluster a network's nodes into sets called "communities", such that there are dense connections within communities but sparse connections between them. A popular and statistically principled method to perform such clustering is to use a family of generative models known as stochastic block models (SBMs). In this paper, we show that maximum likelihood estimation in an SBM is a network analog of a well-known continuum surface-tension problem that arises from an application in metallurgy. To illustrate the utility of this relationship, we implement network analogs of three surface-tension algorithms, with which we successfully recover planted community structure in synthetic networks and which yield fascinating insights on empirical networks that we construct from hyperspectral videos.

Discussion (0). Sign in to comment.

Pith tools