Two-sample Hypothesis Testing for Inhomogeneous Random Graphs (Q126111)

Testing random graphs is challenging problem especially in large dimensions (chemical compounds graphs, brain networks of several patients analysis, and other). This paper focuses on the drawing inference from large sparse networks and consider the graphs on a common vertex set sampled from an inhomogeneous Erdös-Rényi model [\textit{B. Bollobàs} et al., Random Struct. Algorithms 31, No. 1, 3--122 (2007; Zbl 1123.05083)]. The latter model is considered in the case when no structural assumption on the population adjacency matrix is assumed.