Community detection in sparse random networks (Q894814): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.1478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in dense 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: Moment inequalities for functions of independent random variables / 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: Finding Hidden Cliques in Linear Time with High Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959905 / 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: Bayesian anomaly detection methods for social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Statistical Hypotheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief propagation, robust reconstruction and optimal recovery of block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected graphs inside-out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all cubic graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all regular graphs are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Limiting Distribution of a Graph Scan Statistic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs and Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in sparse random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3058573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank

Latest revision as of 02:37, 11 July 2024

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

    Statements

    Community detection in sparse random networks (English)
    0 references
    0 references
    0 references
    24 November 2015
    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
    planted subgraph problem
    0 references
    scan statistic
    0 references
    largest connected component
    0 references

    Identifiers

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