Pages that link to "Item:Q651016"

The following pages link to Spectral clustering and the high-dimensional stochastic blockmodel (Q651016):

Displaying 50 items.

• Model-based clustering of multiple networks with a hierarchical algorithm (Q57414) (← links)
• Pseudo-likelihood methods for community detection in large sparse networks (Q90059) (← links)
• Estimating the number of communities by spectral methods (Q90067) (← links)
• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Fast community detection by SCORE (Q144808) (← links)
• Rate-optimal graphon estimation (Q159635) (← links)
• On the question of effective sample size in network modeling: an asymptotic inquiry (Q254438) (← links)
• Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world? (Q262369) (← links)
• Empirical Bayes estimation for the stochastic blockmodel (Q262706) (← links)
• Estimating multivariate latent-structure models (Q282450) (← links)
• A limit theorem for scaled eigenvectors of random dot product graphs (Q288255) (← links)
• Impact of regularization on spectral clustering (Q309744) (← links)
• Bayesian degree-corrected stochastic blockmodels for community detection (Q315413) (← links)
• Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels (Q385773) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
• Reconstruction and estimation in the planted partition model (Q495549) (← links)
• The method of moments and degree distributions for network models (Q661156) (← links)
• Spectral clustering in the dynamic stochastic block model (Q668613) (← links)
• A variational approach to the consistency of spectral clustering (Q723005) (← links)
• Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
• Detection of structurally homogeneous subsets in graphs (Q746312) (← links)
• Large-scale estimation of random graph models with local dependence (Q830532) (← links)
• Two sample tests for high-dimensional autocovariances (Q830592) (← links)
• Matrix and discrepancy view of generalized random and quasirandom graphs (Q908195) (← links)
• Perturbation analysis for the normalized Laplacian matrices in the multiway spectral clustering method (Q1616182) (← links)
• Consistency of modularity clustering on random geometric graphs (Q1617118) (← links)
• Bayesian community detection (Q1631576) (← links)
• Community detection by \(L_{0}\)-penalized graph Laplacian (Q1639201) (← links)
• The expected adjacency and modularity matrices in the degree corrected stochastic block model (Q1642900) (← links)
• Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm (Q1657975) (← links)
• A spectral algorithm with additive clustering for the recovery of overlapping communities in networks (Q1663638) (← links)
• A review of dynamic network models with latent variables (Q1670776) (← links)
• Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer (Q1727851) (← links)
• A critical threshold for design effects in network sampling (Q1731771) (← links)
• Testing goodness of fit of random graph models (Q1736535) (← links)
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications (Q1747024) (← links)
• Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Contiguity and non-reconstruction results for planted partition models: the dense case (Q1748922) (← links)
• Community detection in degree-corrected block models (Q1800797) (← links)
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs (Q1800805) (← links)
• Consistency of community detection in networks under degree-corrected stochastic block models (Q1940773) (← links)
• Consistency of maximum-likelihood and variational estimators in the stochastic block model (Q1950883) (← links)
• Classification and estimation in the stochastic blockmodel based on the empirical degrees (Q1950919) (← links)
• Sparse integrative clustering of multiple omics data sets (Q1951531) (← links)
• Fusing data depth with complex networks: community detection with prior information (Q2002721) (← links)
• Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model (Q2008607) (← links)
• Convex relaxation methods for community detection (Q2038282) (← links)