Pages that link to "Item:Q2962142"
From MaRDI portal
The following pages link to A nonparametric view of network models and Newman–Girvan and other modularities (Q2962142):
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)
- The stochastic topic block model for the clustering of vertices in networks with textual edges (Q111344) (← links)
- Simple measures of uncertainty for model selection (Q127484) (← links)
- Fast community detection by SCORE (Q144808) (← links)
- Mixed Membership Estimation for Social Networks (Q144810) (← links)
- Network Cross-Validation for Determining the Number of Communities in Network Data (Q159626) (← links)
- Rate-optimal graphon estimation (Q159635) (← links)
- On the question of effective sample size in network modeling: an asymptotic inquiry (Q254438) (← links)
- Empirical Bayes estimation for the stochastic blockmodel (Q262706) (← links)
- Sharp total variation bounds for finitely exchangeable arrays (Q277272) (← 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)
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models (Q341136) (← links)
- Consistency under sampling of exponential random graph models (Q355086) (← links)
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels (Q385773) (← links)
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters (Q476218) (← links)
- A testing based extraction algorithm for identifying significant communities in networks (Q484064) (← links)
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
- Reconstruction and estimation in the planted partition model (Q495549) (← links)
- Overlapping stochastic block models with application to the French political blogosphere (Q542476) (← links)
- Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- The method of moments and degree distributions for network models (Q661156) (← links)
- Spectral clustering in the dynamic stochastic block model (Q668613) (← links)
- Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
- Detection of structurally homogeneous subsets in graphs (Q746312) (← links)
- Clique-based method for social network clustering (Q779032) (← links)
- Large-scale estimation of random graph models with local dependence (Q830532) (← links)
- Subsampling bootstrap of count features of networks (Q892240) (← links)
- Community detection in sparse random networks (Q894814) (← links)
- Vertex nomination schemes for membership prediction (Q902928) (← links)
- Matrix and discrepancy view of generalized random and quasirandom graphs (Q908195) (← links)
- Strategies for online inference of model-based clustering in large and growing networks (Q993242) (← links)
- Consistency of modularity clustering on random geometric graphs (Q1617118) (← links)
- Bayesian community detection (Q1631576) (← links)
- Network-based naive Bayes model for social network (Q1635847) (← links)
- Community detection by \(L_{0}\)-penalized graph Laplacian (Q1639201) (← links)
- The future of statistics and data science (Q1642377) (← links)
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm (Q1657975) (← links)
- Estimating large covariance matrix with network topology for high-dimensional biomedical data (Q1663109) (← links)
- Estimating a network from multiple noisy realizations (Q1711599) (← links)
- Testing goodness of fit of random graph models (Q1736535) (← links)
- On semidefinite relaxations for the block model (Q1747735) (← links)
- Contiguity and non-reconstruction results for planted partition models: the dense case (Q1748922) (← links)
- Cluster forests (Q1800126) (← links)
- Community detection in degree-corrected block models (Q1800797) (← links)
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs (Q1800805) (← links)
