Statistical inference on random dot product graphs: a survey
The random dot product graph (RDPG) is an independent-edge random graph that is
analytically tractable and, simultaneously, either encompasses or can successfully …
analytically tractable and, simultaneously, either encompasses or can successfully …
Statistical connectomics
The data science of networks is a rapidly developing field with myriad applications. In
neuroscience, the brain is commonly modeled as a connectome, a network of nodes …
neuroscience, the brain is commonly modeled as a connectome, a network of nodes …
Sparse graphs using exchangeable random measures
Statistical network modelling has focused on representing the graph as a discrete structure,
namely the adjacency matrix. When assuming exchangeability of this array—which can aid …
namely the adjacency matrix. When assuming exchangeability of this array—which can aid …
Inference for multiple heterogeneous networks with a common invariant subspace
The development of models and methodology for the analysis of data from multiple
heterogeneous networks is of importance both in statistical network theory and across a …
heterogeneous networks is of importance both in statistical network theory and across a …
A statistical interpretation of spectral embedding: the generalised random dot product graph
Spectral embedding is a procedure which can be used to obtain vector representations of
the nodes of a graph. This paper proposes a generalisation of the latent position network …
the nodes of a graph. This paper proposes a generalisation of the latent position network …
Estimating mixed memberships with sharp eigenvector deviations
We consider the problem of estimating community memberships of nodes in a network,
where every node is associated with a vector determining its degree of membership in each …
where every node is associated with a vector determining its degree of membership in each …
Community detection on mixture multilayer networks via regularized tensor decomposition
Community detection on mixture multilayer networks via regularized tensor decomposition
Page 1 The Annals of Statistics 2021, Vol. 49, No. 6, 3181–3205 https://doi.org/10.1214/21-AOS2079 …
Page 1 The Annals of Statistics 2021, Vol. 49, No. 6, 3181–3205 https://doi.org/10.1214/21-AOS2079 …
On a two-truths phenomenon in spectral graph clustering
Clustering is concerned with coherently grouping observations without any explicit concept
of true groupings. Spectral graph clustering—clustering the vertices of a graph based on …
of true groupings. Spectral graph clustering—clustering the vertices of a graph based on …
A semiparametric two-sample hypothesis testing problem for random graphs
Two-sample hypothesis testing for random graphs arises naturally in neuroscience, social
networks, and machine learning. In this article, we consider a semiparametric problem of two …
networks, and machine learning. In this article, we consider a semiparametric problem of two …
Limit theorems for eigenvectors of the normalized Laplacian for random graphs
We prove a central limit theorem for the components of the eigenvectors corresponding to
the d largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random …
the d largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random …