Robust identification in random variable networks

A class of distribution free multiple decision statistical procedures is proposed for threshold graph identification in correlation networks. The decision procedures are based on simultaneous application of sign statistics. It is proved that single step, step down Holm and step up Hochberg statistic...

Full description

Saved in:
Bibliographic Details
Published inJournal of statistical planning and inference Vol. 181; pp. 30 - 40
Main Authors Kalyagin, Valery A., Koldanov, Alexander P., Koldanov, Petr A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.02.2017
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A class of distribution free multiple decision statistical procedures is proposed for threshold graph identification in correlation networks. The decision procedures are based on simultaneous application of sign statistics. It is proved that single step, step down Holm and step up Hochberg statistical procedures for threshold graph identification are distribution free in sign similarity network in the class of elliptically contoured distributions. Moreover it is shown that these procedures can be adapted for distribution free threshold graph identification in Pearson correlation network. •Robust statistical procedures for threshold graph identification are proposed.•Statistical procedures are based on simultaneous application of sign tests.•It is proved that well known multiple testing statistical procedures are robust.
ISSN:0378-3758
1873-1171
DOI:10.1016/j.jspi.2016.08.008