On the Log Partition Function of Ising Model on Stochastic Block Model
Abstract
A sparse stochastic block model (SBM) with two communities is defined by the community probability π0,π1, and the connection probability between communities a,b∈\0,1\, namely qab = αabn. When qab is constant in a,b, the random graph is simply the Erdos-R\'eny random graph. We evaluate the log partition function of the Ising model on sparse SBM with two communities. As an application, we give consistent parameter estimation of the sparse SBM with two communities in a special case. More specifically, let d0,d1 be the average degree of the two communities, i.e., d0def=π0α00+π1α01,d1def=π0α10+π1α11. We focus on the regime d0=d1 (the regime d0 d1 is trivial). In this regime, there exists d,λ and r≥ 0 with π0=11+r, π1=r1+r, α00=d(1+rλ), α01=α10 = d(1-λ), α11 = d(1+λr). We give a consistent estimator of r when λ<0. The estimator of λ given by mossel2015reconstruction is valid in the general situation. We also provide a random clustering algorithm which does not require knowledge of parameters and which is positively correlated with the true community label when λ<0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.