On Inference for Modularity Statistics in Structured Networks
From MaRDI portal
Cites work
- A Block Model for Node Popularity in Networks with Community Structure
- A goodness-of-fit test for stochastic block models
- A Hypothesis Testing Framework for Modularity Based Network Community Detection
- A nonparametric view of network models and Newman–Girvan and other modularities
- A statistical interpretation of spectral embedding: the generalised random dot product graph
- Asymptotic distribution of modularity in networks
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Community detection and stochastic block models: recent developments
- Community detection in temporal multilayer networks, with an application to correlation networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Consistent community detection in multi-layer network data
- Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure
- Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
- Fast unfolding of communities in large networks
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- Learning latent block structure in weighted networks
- Mixed membership stochastic blockmodels
- Modularity Maximization for Graphons
- Network classification with applications to brain connectomics
- Network cross-validation by edge sampling
- Network cross-validation for determining the number of communities in network data
- Networks
- Node Features Adjusted Stochastic Block Model
- On a two-truths phenomenon in spectral graph clustering
- On estimation and inference in latent structure random graphs
- Optimal Estimation of the Number of Network Communities
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Popularity Adjusted Block Models are Generalized Random Dot Product Graphs
- Random Graphs
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- The asymptotic distribution of modularity in weighted signed networks
- The eigenvalues of random symmetric matrices
- The Elimination Matrix: Some Lemmas and Applications
- The phase transition in inhomogeneous random graphs
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Universal rank inference via residual subsampling with application to large networks
Cited in
(1)
This page was built for publication: On Inference for Modularity Statistics in Structured Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968267)
