Statistical inference on graphs: Selected Topics

For the most part, we will be focusing on graphs that are undirected (ie, edges do not have orientation) and simple (ie, no multi-edges or self-loops). Alternatively, one can also represent a graph as an adjacency matrix A=(Aij) i, j∈[n], which is an n× n symmetric binary matrix with zero diagonal. In particular, for a simple and undirected graph G=(V, E), the entries Aij are defined as: