Pages that link to "Item:Q894814"
From MaRDI portal
The following pages link to Community detection in sparse random networks (Q894814):
Displaying 35 items.
- Two-sample Hypothesis Testing for Inhomogeneous Random Graphs (Q126111) (← links)
- Spectral clustering in the dynamic stochastic block model (Q668613) (← links)
- Finding one community in a sparse graph (Q892403) (← links)
- Community detection in sparse random networks (Q894814) (← links)
- Detection thresholds for the \(\beta\)-model on sparse graphs (Q1650079) (← links)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
- Computing exact \(p\)-values for community detection (Q1987192) (← links)
- Detecting a planted community in an inhomogeneous random graph (Q2040057) (← links)
- Detecting a botnet in a network (Q2078962) (← links)
- Sharp local minimax rates for goodness-of-fit testing in multivariate binomial and Poisson families and in multinomials (Q2102432) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Uniform estimation in stochastic block models is slow (Q2137819) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Hypothesis testing in sparse weighted stochastic block model (Q2165832) (← links)
- Statistical limits of spiked tensor models (Q2179237) (← links)
- Cliques in rank-1 random graphs: the role of inhomogeneity (Q2278662) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Sharp detection boundaries on testing dense subhypergraph (Q2676927) (← links)
- Concentration and stability of community-detecting functions on random networks (Q2808834) (← links)
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications (Q2898016) (← links)
- (Q3306931) (← links)
- Identifying Community Structures from Network Data via Maximum Likelihood Methods (Q3573081) (← links)
- The k-Dense Method to Extract Communities from Complex Networks (Q3627917) (← links)
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness (Q4967226) (← links)
- Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION (Q5122141) (← links)
- Probabilistic Community Detection With Unknown Number of Communities (Q5231515) (← links)
- How robust are reconstruction thresholds for community detection? (Q5361883) (← links)
- (Q5368641) (← links)
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities (Q5881227) (← links)
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes (Q5885123) (← links)
- Optimization via low-rank approximation for community detection in networks (Q5963526) (← links)
- Testing correlation of unlabeled random graphs (Q6109918) (← links)
- Average Jaccard index of random graphs (Q6639521) (← links)
- Heterogeneous dense subhypergraph detection (Q6668604) (← links)