Statistical inference on random dot product graphs: a survey

zbMath1473.05279arXiv1709.05454MaRDI QIDQ4558565

Yichen Qin, Youngser Park, Keith Levin, Minh Tang, Donniell E. Fishkind, Daniel L. Sussman, Vince Lyzinski, Avanti Athreya, Carey E. Priebe, Joshua T. Vogelstein

Publication date: 22 November 2018

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

zbMATH Keywords

random dot product graph; semiparametric modeling; adjacency spectral embedding; Laplacian spectral embedding; multi-sample graph hypothesis testing

Mathematics Subject Classification ID

62H10: Multivariate distribution of statistics

62H30: Classification and discrimination; cluster analysis (statistical aspects)

62H15: Hypothesis testing in multivariate analysis

05C90: Applications of graph theory

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C80: Random graphs (graph-theoretic aspects)

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C76: Graph operations (line graphs, products, etc.)

Related Items

Unnamed Item, A multivariate extreme value theory approach to anomaly clustering and visualization, Vertex nomination, consistent estimation, and adversarial modification, Bayesian estimation of the latent dimension and communities in stochastic blockmodels

Uses Software

• mclust
• energy

Cites Work

• Equivalence of distance-based and RKHS-based statistics in hypothesis testing
• A nonparametric two-sample hypothesis testing problem for random graphs
• Empirical Bayes estimation for the stochastic blockmodel
• A limit theorem for scaled eigenvectors of random dot product graphs
• On the incommensurability phenomenon
• Belief propagation, robust reconstruction and optimal recovery of block models
• Universally consistent vertex classification for latent positions graphs
• Distance covariance in metric spaces
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Energy statistics: a class of statistics based on distances
• Spectra of edge-independent random graphs
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
• Modeling graphs using dot product representations
• Spectral clustering and the high-dimensional stochastic blockmodel
• The method of moments and degree distributions for network models
• Vertex nomination schemes for membership prediction
• Statistical analysis of network data. Methods and models
• Automatic dimensionality selection from the scree plot via the use of profile likelihood
• The geometry of mixture likelihoods: A general theory
• Modeling by shortest data description
• Strong consistency of k-means clustering
• The eigenvalues of random symmetric matrices
• Estimating the dimension of a model
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• A proof of the block model threshold conjecture
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Reducing multidimensional two-sample data to one-dimensional interpoint comparisons
• MCLUST: Software for model-based cluster analysis
• Matrix estimation by universal singular value thresholding
• Consistency of spectral clustering in stochastic block models
• Role of normalization in spectral clustering for stochastic blockmodels
• The Kato-Temple inequality and eigenvalue concentration with applications to graph inference
• Community detection in dense random networks
• 10.1162/153244302760185252
• RANDOM MATRICES: UNIVERSAL PROPERTIES OF EIGENVECTORS
• A nonparametric view of network models and Newman–Girvan and other modularities
• Spectral redemption in clustering sparse networks
• Exact Recovery in the Stochastic Block Model
• Mixed membership stochastic blockmodels
• Large-Sample Theory: Parametric Case
• On Divergences and Informations in Statistics and Information Theory
• Matrix Analysis
• On the asymptotics of M-hypothesis Bayesian detection
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Latent Space Approaches to Social Network Analysis
• Laplacian Eigenmaps From Sparse, Noisy Similarity Measurements
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• Stochastic Blockmodels for Directed Graphs
• A Survey of Statistical Network Models
• A useful variant of the Davis–Kahan theorem for statisticians
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• The phase transition in inhomogeneous random graphs
• Concentration and regularization of random graphs
• Universality, Characteristic Kernels and RKHS Embedding of Measures
• Random Dot Product Graph Models for Social Networks
• An Introduction to Matrix Concentration Inequalities
• Random Graphs
• The Rotation of Eigenvectors by a Perturbation. III
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A goodness-of-fit test for stochastic block models
• A new look at the statistical model identification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item