Community detection in dense random networks (Q2510823): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in dense random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal detection of sparse principal components in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonparametric view of network models and Newman–Girvan and other modularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of moments and degree distributions for network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of a sparse submatrix of a high-dimensional noisy matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Detection of Heterogeneous and Heteroscedastic Mixtures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hidden Cliques in Linear Time with High Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher criticism for detecting sparse heterogeneous mixtures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical algorithms and a lower bound for detecting planted cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Innovated higher criticism for detecting sparse signals in correlated noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian anomaly detection methods for social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems of hypothesis testing leading to infinitely divisible distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of a signal of known shape in a multichannel system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection boundary in sparse regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Dense Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spatial scan statistic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Statistical Hypotheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to nonparametric estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 19:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Community detection in dense random networks
scientific article

    Statements

    Community detection in dense random networks (English)
    0 references
    0 references
    0 references
    4 August 2014
    0 references
    community detection
    0 references
    detecting a dense subgraph
    0 references
    minimax hypothesis testing
    0 references
    Erdős-Rényi random graph
    0 references
    scan statistic
    0 references
    planted clique problem
    0 references
    dense \(k\)-subgraph problem
    0 references
    sparse eigenvalue problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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