Hypotheses Testing on Infinite Random Graphs
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.
Cite
Text
Ryabko. "Hypotheses Testing on Infinite Random Graphs." Proceedings of the 28th International Conference on Algorithmic Learning Theory, 2017.Markdown
[Ryabko. "Hypotheses Testing on Infinite Random Graphs." Proceedings of the 28th International Conference on Algorithmic Learning Theory, 2017.](https://mlanthology.org/alt/2017/ryabko2017alt-hypotheses/)BibTeX
@inproceedings{ryabko2017alt-hypotheses,
title = {{Hypotheses Testing on Infinite Random Graphs}},
author = {Ryabko, Daniil},
booktitle = {Proceedings of the 28th International Conference on Algorithmic Learning Theory},
year = {2017},
pages = {400-411},
volume = {76},
url = {https://mlanthology.org/alt/2017/ryabko2017alt-hypotheses/}
}