LOCALLY OPTIMAL RANK-BASED TESTS FOR MULTIVARIATE RANDOMNESS

被引：0
|
作者：
HALLIN, M
INGENBLEEK, JF
PURI, ML
机构：
[1] UNIV LIBRE BRUXELLES,INST STAT,B-1050 BRUSSELS,BELGIUM
[2] INDIANA UNIV,DEPT MATH,BLOOMINGTON,IN 47405
来源：
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE | 1986年 / 303卷 / 17期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：901 / 904
页数：4
相关论文
共 50 条
  • [21] A class of rank-based tests for doubly-truncated data
    Shen, Pao-Sheng
    TEST, 2013, 22 (01) : 83 - 102
  • [22] Rank-based tests for interactions in a two-way design
    Wilcox, RR
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 1999, 29 (03) : 275 - 284
  • [23] Adaptive rank-based tests for high dimensional mean problems
    Zhang, Yu
    Feng, Long
    STATISTICS & PROBABILITY LETTERS, 2024, 214
  • [24] Rank-Based Multivariate Sarmanov for Modeling Dependence between Loss Reserves
    Abdallah, Anas
    Wang, Lan
    RISKS, 2023, 11 (11)
  • [25] A New Rank-based Multivariate CUSUM Approach for Monitoring the Process Mean
    Hwang, Wook-Yeon
    QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2016, 32 (03) : 1167 - 1178
  • [26] Nonparametric rank-based statistics and significance tests for fuzzy data
    Denoeux, T
    Masson, MH
    Hébert, PA
    FUZZY SETS AND SYSTEMS, 2005, 153 (01) : 1 - 28
  • [27] ASYMPTOTICALLY MOST POWERFUL RANK-TESTS FOR MULTIVARIATE RANDOMNESS AGAINST SERIAL DEPENDENCE
    HALLIN, M
    INGENBLEEK, JF
    PURI, ML
    JOURNAL OF MULTIVARIATE ANALYSIS, 1989, 30 (01) : 34 - 71
  • [28] Optimal rank-based detection of exponential component in autoregressive models
    El Melhaoui, Said
    Allal, Jelloul
    JOURNAL OF NONPARAMETRIC STATISTICS, 2006, 18 (7-8) : 431 - 447
  • [29] LINEAR RANK-TESTS FOR RANDOMNESS
    HALLIN, M
    INGENBLEEK, JF
    PURI, ML
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1985, 301 (02): : 49 - 52
  • [30] RANK-BASED PERSISTENCE
    Bergomi, Mattia G.
    Vertechi, Pietro
    THEORY AND APPLICATIONS OF CATEGORIES, 2020, 35 : 228 - 260
12345