Community detection in degree-corrected block models (Q1800797): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:44, 5 March 2024

scientific article
Language Label Description Also known as
English
Community detection in degree-corrected block models
scientific article

    Statements

    Community detection in degree-corrected block models (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 October 2018
    0 references
    Understanding the community structure is crucial for the complex networks' internal organization research via finding underlying structures in the unlabeled network data. The main contribution of this paper are two theorems giving the minimax upper and lower bounds of the introduced maximum likelihood estimator. These theorems characterize the asymptotic behavior of the risk bounds. Proved general fundamental limits allow the community sizes to differ and the number of communities \(k\) to grow to infinity with the number of nodes \(n\). A polynomial-time algorithm is proposed to adaptively perform consistent and asymptotically optimal community detection since it does not involve convex programming. The efficiency of the constructed theory is confirmed by experimental results.
    0 references
    clustering
    0 references
    minimax rates
    0 references
    network analysis
    0 references
    spectral clustering
    0 references
    stochastic block model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references