Two-sample Hypothesis Testing for Inhomogeneous Random Graphs (Q126111)
From MaRDI portal
(Redirected from Item:Q2215732)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-sample Hypothesis Testing for Inhomogeneous Random Graphs |
scientific article; zbMATH DE number 7285291
- Two-sample hypothesis testing for inhomogeneous random graphs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-sample Hypothesis Testing for Inhomogeneous Random Graphs |
scientific article; zbMATH DE number 7285291 |
|
Statements
4 July 2017
0 references
14 December 2020
0 references
stat.ME
0 references
stat.ML
0 references
Two-sample hypothesis testing for inhomogeneous random graphs (English)
0 references
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.
0 references
minimax testing
0 references
inhomogeneous Erdős-Rényi model
0 references
two-sample test
0 references
0 references
0.782103955745697
0 references
0.7527433037757874
0 references
0.7393026947975159
0 references
0.7333905100822449
0 references
