The method of moments and degree distributions for network models

DOI10.1214/11-AOS904zbMath1232.91577arXiv1202.5101OpenAlexW3103925118WikidataQ105584257 ScholiaQ105584257MaRDI QIDQ661156

Aiyou Chen, Elizaveta Levina, Peter J. Bickel

Publication date: 21 February 2012

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.5101

zbMATH Keywords

social networks community detection block model

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Social networks; opinion dynamics (91D30) Characterization and structure theory of statistical distributions (62E10)

Related Items

Affiliation weighted networks with a differentially private degree sequence, Hierarchical Community Detection by Recursive Partitioning, Large-scale estimation of random graph models with local dependence, Edgeworth expansions for network moments, Motif estimation via subgraph sampling: the fourth-moment phenomenon, A limit theorem for scaled eigenvectors of random dot product graphs, Bootstrapping exchangeable random graphs, Uniform estimation in stochastic block models is slow, Testing for Equivalence of Network Distribution Using Subgraph Counts, Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence, Directed weighted random graphs with an increasing bi-degree sequence, Detection thresholds for the \(\beta\)-model on sparse graphs, A Network Structural Approach to the Link Prediction Problem, Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models, Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence, Asymptotic in the ordered networks with a noisy degree sequence, Asymptotic in undirected random graph models with a noisy degree sequence, Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, Subsampling bootstrap of count features of networks, Random cographs: Brownian graphon limit and asymptotic degree distribution, Inference for High-Dimensional Exchangeable Arrays, Unnamed Item, Learning sparse graphons and the generalized Kesten-Stigum threshold, Empirical Likelihood and Uniform Convergence Rates for Dyadic Kernel Density Estimation, On sparsity, power-law, and clustering properties of graphex processes, Non-representative sampled networks: estimation of network structural properties by weighting, Kernel density estimation for undirected dyadic data, Sparse Graphs Using Exchangeable Random Measures, Bivariate gamma model, Consistency of maximum-likelihood and variational estimators in the stochastic block model, Classification and estimation in the stochastic blockmodel based on the empirical degrees, Consistent Estimation of the Number of Communities via Regularized Network Embedding, Theoretical and computational guarantees of mean field variational inference for community detection, Bootstrap estimators for the tail-index and for the count statistics of graphex processes, Co-clustering separately exchangeable network data, 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, Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding, Asymptotic distributions in affiliation networks with an increasing sequence, A motif building process for simulating random networks, Unnamed Item, Sparse exchangeable graphs and their limits via graphon processes, Towards optimal estimation of bivariate isotonic matrices with unknown permutations, Statistical inference on random dot product graphs: a survey, A weak law for moments of pairwise stable networks, Pseudo-likelihood methods for community detection in large sparse networks, Adjusted chi-square test for degree-corrected block models, Community detection in dense random networks, Asymptotics in directed exponential random graph models with an increasing bi-degree sequence, Additive and multiplicative effects network models, Network representation using graph root distributions, Empirical process results for exchangeable arrays, Consistent structure estimation of exponential-family random graph models with block structure, Review of statistical network analysis: models, algorithms, and software, Consistent nonparametric estimation for heavy-tailed sparse graphs, Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection, Optimal graphon estimation in cut distance, Testing for high-dimensional geometry in random graphs, Weighted stochastic block model, Community detection on mixture multilayer networks via regularized tensor decomposition, Optimal adaptivity of signed-polygon statistics for network testing, Using the bootstrap for statistical inference on random graphs, Limit theorems for distributions invariant under groups of transformations, Matrix estimation by universal singular value thresholding

Cites Work