A nonparametric view of network models and Newman–Girvan and other modularities
From MaRDI portal
Publication:2962142
DOI10.1073/pnas.0907096106zbMath1359.62411OpenAlexW2064274783WikidataQ37482140 ScholiaQ37482140MaRDI QIDQ2962142
Publication date: 16 February 2017
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.0907096106
Asymptotic properties of nonparametric inference (62G20) Neural nets and related approaches to inference from stochastic processes (62M45)
Related Items
The dynamic random subgraph model for the clustering of evolving networks, Improved Bayesian inference for the stochastic block model with application to large networks, Hierarchical Community Detection by Recursive Partitioning, Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes, Optimal Bipartite Network Clustering, Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering, Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks, Edge Exchangeable Models for Interaction Networks, A deep stochastic model for detecting community in complex networks, Unnamed Item, Approximate estimation in a class of directed networks, Asymptotic in undirected random graph models with a noisy degree sequence, Nonparametric statistics of dynamic networks with distinguishable nodes, Test on stochastic block model: local smoothing and extreme value theory, Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models, Triangular Concordance Learning of Networks, Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising, Classified generalized linear mixed model prediction incorporating pseudo‐prior information, Inference for High-Dimensional Exchangeable Arrays, Pseudo-Bayesian Classified Mixed Model Prediction, Mixture models and networks: The stochastic blockmodel, Poisson approximation of subgraph counts in stochastic block models and a graphon model, A distributed community detection algorithm for large scale networks under stochastic block models, Community detection with structural and attribute similarities, Estimating Causal Peer Influence in Homophilous Social Networks by Inferring Latent Locations, Hypothesis testing for populations of networks, Large volatility matrix analysis using global and national factor models, Fast Network Community Detection With Profile-Pseudo Likelihood Methods, Combinatorial statistics and the sciences, Unnamed Item, Unnamed Item, Unnamed Item, Modularity in planted partition model, Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models, Spectral redemption in clustering sparse networks, Asymptotic uncertainty quantification for communities in sparse planted bi-section models, Learning sparse graphons and the generalized Kesten-Stigum threshold, Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks, Statistical embedding: beyond principal components, Clustering heterogeneous financial networks, On sparsity, power-law, and clustering properties of graphex processes, Non-representative sampled networks: estimation of network structural properties by weighting, Adaptive randomization in network data, Asymptotic mutual information for the balanced binary stochastic block model, Sparse Graphs Using Exchangeable Random Measures, Core-periphery structure in networks: a statistical exposition, Multiobjective blockmodeling for social network analysis, Co-clustering separately exchangeable network data, The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul, Dynamic degree-corrected blockmodels for social networks: A nonparametric approach, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Corrected Bayesian Information Criterion for Stochastic Block Models, Mixed-Effect Time-Varying Network Model and Application in Brain Connectivity Analysis, Correlation enhanced modularity-based belief propagation method for community detection in networks, Unnamed Item, Unnamed Item, A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs, Sparse exchangeable graphs and their limits via graphon processes, Community Detection and Stochastic Block Models, Statistical inference on random dot product graphs: a survey, Unnamed Item, Adjacency matrix comparison for stochastic block models, Community detection in dense random networks, Optimization via low-rank approximation for community detection in networks, Relational exchangeability, Confidence sets for network structure, Review of statistical network analysis: models, algorithms, and software, Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood, Unnamed Item, Node Features Adjusted Stochastic Block Model, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Probabilistic Community Detection With Unknown Number of Communities, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, Unnamed Item, Using the bootstrap for statistical inference on random graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Robust and computationally feasible community detection in the presence of arbitrary outlier nodes, Detecting Overlapping Communities in Networks Using Spectral Methods, The hierarchy of block models, Null models and community detection in multi-layer networks, Scalable estimation of epidemic thresholds via node sampling, A likelihood-ratio type test for stochastic block models with bounded degrees, Consistency of modularity clustering on random geometric graphs, Sharp total variation bounds for finitely exchangeable arrays, Smoothing graphons for modelling exchangeable relational data, Large-scale estimation of random graph models with local dependence, Edgeworth expansions for network moments, A limit theorem for scaled eigenvectors of random dot product graphs, A review on spectral clustering and stochastic block models, Bayesian community detection, Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator, Uniform estimation in stochastic block models is slow, Network-based naive Bayes model for social network, Impact of regularization on spectral clustering, Community detection by \(L_{0}\)-penalized graph Laplacian, Bayesian degree-corrected stochastic blockmodels for community detection, The future of statistics and data science, On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization, Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Consistency under sampling of exponential random graph models, Estimating large covariance matrix with network topology for high-dimensional biomedical data, A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships, Consistency and asymptotic normality of latent block model estimators, Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels, Subsampling bootstrap of count features of networks, Community detection in sparse random networks, Consistency of community detection in networks under degree-corrected stochastic block models, Vertex nomination schemes for membership prediction, Vertex nomination, consistent estimation, and adversarial modification, Bivariate gamma model, Matrix and discrepancy view of generalized random and quasirandom graphs, Consistency of maximum-likelihood and variational estimators in the stochastic block model, Classification and estimation in the stochastic blockmodel based on the empirical degrees, Posterior contraction rates for stochastic block models, Bayesian estimation of the latent dimension and communities in stochastic blockmodels, Estimating a network from multiple noisy realizations, Theoretical and computational guarantees of mean field variational inference for community detection, Spectral clustering and the high-dimensional stochastic blockmodel, Bootstrap estimators for the tail-index and for the count statistics of graphex processes, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, The method of moments and degree distributions for network models, A testing based extraction algorithm for identifying significant communities in networks, Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding, Testing goodness of fit of random graph models, Spectral clustering in the dynamic stochastic block model, Reconstruction and estimation in the planted partition model, A motif building process for simulating random networks, Maximum likelihood estimation of sparse networks with missing observations, On semidefinite relaxations for the block model, Contiguity and non-reconstruction results for planted partition models: the dense case, Model-based clustering of multiple networks with a hierarchical algorithm, Spectral based hypothesis testing for community detection in complex networks, Overlapping stochastic block models with application to the French political blogosphere, Review on statistical methods for gene network reconstruction using expression data, Model selection in overlapping stochastic block models, Pseudo-likelihood methods for community detection in large sparse networks, Estimating the number of communities by spectral methods, The stochastic topic block model for the clustering of vertices in networks with textual edges, Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces, Strategies for online inference of model-based clustering in large and growing networks, Network modelling of topological domains using Hi-C data, Network classification with applications to brain connectomics, Simple measures of uncertainty for model selection, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, A statistical framework for modern network science, Network representation using graph root distributions, Empirical process results for exchangeable arrays, Cluster forests, Community detection in sparse networks via Grothendieck's inequality, The geometry of continuous latent space models for network data, Community detection in degree-corrected block models, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, Fast community detection by SCORE, Mixed Membership Estimation for Social Networks, Model-based clustering of time-evolving networks through temporal exponential-family random graph models, Profile likelihood biclustering, Consistent structure estimation of exponential-family random graph models with block structure, Network Cross-Validation for Determining the Number of Communities in Network Data, Rate-optimal graphon estimation, Detection of structurally homogeneous subsets in graphs, Consistent nonparametric estimation for heavy-tailed sparse graphs, Community detection with dependent connectivity, Optimal graphon estimation in cut distance, Dynamic network models and graphon estimation, Weighted stochastic block model, Clique-based method for social network clustering, Remarks on power-law random graphs, Matrix estimation by universal singular value thresholding, Consistency of spectral clustering in stochastic block models, Correction to the proof of consistency of community detection, Convergence of the groups posterior distribution in latent or stochastic block models, Differential calculus on graphon space, Role of normalization in spectral clustering for stochastic blockmodels, On the question of effective sample size in network modeling: an asymptotic inquiry, Empirical Bayes estimation for the stochastic blockmodel
Uses Software
Cites Work
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Mixed membership stochastic blockmodels
- Graph limits and exchangeable random graphs
- Mixture models and exploratory analysis in networks
- Dealing With Label Switching in Mixture Models
- The phase transition in inhomogeneous random graphs
- Probabilistic Symmetries and Invariance Principles
