Abstract
The community detection problem, as a special case of inference on graphs, has received much attention lately. However, in the presence of continuous-valued side information, the behavior of a sharp threshold for exact recovery has remained open, and is addressed in this letter. The new proof presented herein has the further advantage of closing the gap between necessary and sufficient conditions for exact recovery threshold that has existed in community detection under finite-alphabet side information.
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.
