Hypotheses testing on infinite random graphs

08/10/2017
by   Daniil Ryabko, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2019

Asymptotic nonparametric statistical analysis of stationary time series

Stationarity is a very general, qualitative assumption, that can be asse...
research
08/30/2017

Planar L-Drawings of Directed Graphs

We study planar drawings of directed graphs in the L-drawing standard. W...
research
05/30/2023

Testing for the Markov Property in Time Series via Deep Conditional Generative Learning

The Markov property is widely imposed in analysis of time series data. C...
research
09/17/2018

Testing relevant hypotheses in functional time series via self-normalization

In this paper we develop methodology for testing relevant hypotheses in ...
research
01/30/2020

Learning the Hypotheses Space from data Part II: Convergence and Feasibility

In part I we proposed a structure for a general Hypotheses Space H, the ...
research
04/18/2023

Independence testing for inhomogeneous random graphs

Testing for independence between graphs is a problem that arises natural...
research
07/14/2021

Time Series Estimation of the Dynamic Effects of Disaster-Type Shock

The paper provides three results for SVARs under the assumption that the...

Please sign up or login with your details

Forgot password? Click here to reset