Abstract
This paper considers community detection in the dynamic binary censored block model. Under this model, the graph is observed at successive times (snapshots), and the node label in the current snapshot is dependent on the same node label in the previous τ snapshots. In this paper, the maximum likelihood estimator of the current node labels is obtained under this model, subject to the observation of the graph in the present and past snapshots, and the exact recovery conditions are derived. Relaxing the maximum likelihood estimator, a semidefinite programming algorithm is proposed for community detection. In the asymptotic regime, a sufficient condition for exact recovery is obtained using the semidefinite programming estimator, which is shown to asymptotically match the sufficient conditions for exact recovery.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
