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 ...

This is a preview. Log in through your library . Abstract The emerging field of network science deals with the tasks of modeling, comparing, and summarizing large data sets that describe complex ...