# Statistical inference on random dot product graphs: a survey

arXiv: https://arxiv.org/abs/1709.05454 · HTML: https://mlsanity.com/paper/1709.05454/

## Key facts

- Cited by 70 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Sep 2017.

## Built on by (most cited first, 30 of 70)

- [Weisfeiler and Leman go Machine Learning: The Story so far](https://mlsanity.com/paper/2112.09992/) (2021)
- [Generative hypergraph clustering: from blockmodels to modularity](https://mlsanity.com/paper/2101.09611/) (2021)
- [Graph Attention Retrospective](https://mlsanity.com/paper/2202.13060/) (2022)
- [Random Graph Matching in Geometric Models: the Case of Complete Graphs](https://mlsanity.com/paper/2202.10662/) (2022)
- [Comparing Foundation Models using Data Kernels](https://mlsanity.com/paper/2305.05126/) (2023)
- [Latent Space Model for Higher-order Networks and Generalized Tensor Decomposition](https://mlsanity.com/paper/2106.16042/) (2021)
- [From Local to Global: Spectral-Inspired Graph Neural Networks](https://mlsanity.com/paper/2209.12054/) (2022)
- [Mutually exciting point process graphs for modelling dynamic networks](https://mlsanity.com/paper/2102.06527/) (2021)
- [Spectral clustering under degree heterogeneity: a case for the random walk Laplacian](https://mlsanity.com/paper/2105.00987/) (2021)
- [Mental State Classification Using Multi-graph Features](https://mlsanity.com/paper/2203.00516/) (2022)
- [Matrix factorisation and the interpretation of geodesic distance](https://mlsanity.com/paper/2106.01260/) (2021)
- [Online Change Point Detection for Weighted and Directed Random Dot Product Graphs](https://mlsanity.com/paper/2201.11222/) (2022)
- [Inducing a hierarchy for multi-class classification problems](https://mlsanity.com/paper/2102.10263/) (2021)
- [Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model](https://mlsanity.com/paper/2207.04600/) (2022)
- [A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs](https://mlsanity.com/paper/2211.03231/) (2022)
- [Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks](https://mlsanity.com/paper/2306.06155/) (2023)
- [Refined Graph Encoder Embedding via Self-Training and Latent Community Recovery](https://mlsanity.com/paper/2405.12797/) (2024)
- [Encoder Embedding for General Graph and Node Classification](https://mlsanity.com/paper/2405.15473/) (2024)
- [Informative core identification in complex networks](https://mlsanity.com/paper/2101.06388/) (2021)
- [Exact Representation of Sparse Networks with Symmetric Nonnegative Embeddings](https://mlsanity.com/paper/2111.03030/) (2021)
- [Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels](https://mlsanity.com/paper/2208.08638/) (2022)
- [Consensus Knowledge Graph Learning via Multi-view Sparse Low Rank Block Model](https://mlsanity.com/paper/2209.13762/) (2022)
- [Gradient-Based Spectral Embeddings of Random Dot Product Graphs](https://mlsanity.com/paper/2307.13818/) (2023)
- [On the Role of Edge Dependency in Graph Generative Models](https://mlsanity.com/paper/2312.03691/) (2023)
- [Leveraging semantically similar queries for ranking via combining representations](https://mlsanity.com/paper/2106.12621/) (2021)
- [Clustered Graph Matching for Label Recovery and Graph Classification](https://mlsanity.com/paper/2205.03486/) (2022)
- [Network two-sample test for block models](https://mlsanity.com/paper/2406.06014/) (2024)
- [Learning Joint and Individual Structure in Network Data with Covariates](https://mlsanity.com/paper/2406.08776/) (2024)
- [Principal Graph Encoder Embedding and Principal Community Detection](https://mlsanity.com/paper/2501.14939/) (2025)
- [Modularity maximisation for graphons](https://mlsanity.com/paper/2101.00503/) (2021)

## Abstract (arXiv)

The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describe a comprehensive paradigm for statistical inference on random dot product graphs, a paradigm centered on spectral embeddings of adjacency and Laplacian matrices. We examine the analogues, in graph inference, of several canonical tenets of classical Euclidean inference: in particular, we summarize a body of existing results on the consistency and asymptotic normality of the adjacency and Laplacian spectral embeddings, and the role these spectral embeddings can play in the construction of single- and multi-sample hypothesis tests for graph data. We investigate several real-world applications, including community detection and classification in large social networks and the determination of functional and biologically relevant network properties from an exploratory data analysis of the Drosophila connectome. We outline requisite background and current open problems in spectral graph inference.