Hypotheses testing on infinite random graphs

zbMATH Open1407.62204arXiv1708.03131MaRDI QIDQ4645657FDOQ4645657

Authors: Daniil Ryabko 

Publication date: 10 January 2019

Abstract: Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a criterion for the existence of a consistent test for complex hypotheses is presented, generalizing the corresponding results on time series. As an application, it is shown how one can test that a tree has the Markov property, or, more generally, to estimate its memory.

Full work available at URL: https://arxiv.org/abs/1708.03131

Recommendations

• Certain statistical problems on graphs
• Two-sample hypothesis testing for inhomogeneous random graphs
• A nonparametric two-sample hypothesis testing problem for random graphs
• Generating infinite random graphs
• Permutation Tests for Infection Graphs

Mathematics Subject Classification ID

Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80)

Cited In (5)

• Testing graphs against an unknown distribution
• Goodness of fit tests for random multigraph models
• Certain statistical problems on graphs
• Searching for a trail of evidence in a maze
• Two-sample hypothesis testing for inhomogeneous random graphs

This page was built for publication: Hypotheses testing on infinite random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645657)