Skip to Main content Skip to Navigation
Conference papers

Hypotheses testing on infinite random graphs

Daniil Ryabko 1
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
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.
Complete list of metadata
Contributor : Daniil Ryabko Connect in order to contact the contributor
Submitted on : Wednesday, November 1, 2017 - 9:40:55 AM
Last modification on : Friday, January 7, 2022 - 3:44:02 AM

Links full text


  • HAL Id : hal-01627330, version 1
  • ARXIV : 1708.03131


Daniil Ryabko. Hypotheses testing on infinite random graphs. ALT 2017 - 28th International Conference on Algorithmic Learning Theory, Oct 2017, kyoto, Japan. pp.1-12. ⟨hal-01627330⟩



Les métriques sont temporairement indisponibles