We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (G n ) n≥0 converging locally to a Galton—Watson tree T (GWT), we provide an explicit formula ...

In this article, we employ a regression formulation to estimate the high-dimensional covariance matrix for a given network structure. Using prior information contained in the network relationships, we ...