Hypotheses testing on infinite random graphs - Archive ouverte HAL Access content directly
Conference Papers Year :

Hypotheses testing on infinite random graphs

(1)
1
Daniil Ryabko
  • Function : Author
  • PersonId : 848126

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.

Dates and versions

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

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More