Hypotheses testing on infinite random graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Hypotheses testing on infinite random graphs

Daniil Ryabko
  • Function : Author
  • PersonId : 848126


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.

Dates and versions

hal-01627330 , version 1 (01-11-2017)



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⟩
53 View
0 Download



Gmail Facebook Twitter LinkedIn More