Saved in:
Bibliographic Details
Main Authors: Gehlot, Shriya, Laha, Arnab Kumar
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.23522
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916816955113472
author Gehlot, Shriya
Laha, Arnab Kumar
author_facet Gehlot, Shriya
Laha, Arnab Kumar
contents Randomness or mutual independence is an important underlying assumption for most widely used statistical methods for circular data. Verifying this assumption is essential to ensure the validity and reliability of the resulting inferences. In this paper, we introduce two tests for assessing the randomness assumption in circular statistics, based on random circular arc graphs (RCAGs). We define and analyze RCAGs in detail, showing that their key properties depend solely on the i.i.d. nature of the data and are independent of the particular underlying continuous circular distribution. Specifically, we derive the edge probability and vertex degree distribution of RCAGs under the randomness assumption. Using these results, we construct two tests: RCAG-EP, which is based on edge probability, and RCAG-DD, which relies on the vertex degree distribution. Through extensive simulations, we demonstrate that both tests are effective, with RCAG-DD often exhibiting higher power than RCAG-EP. Additionally, we explore several real-world applications where these tests can be useful.
format Preprint
id arxiv_https___arxiv_org_abs_2506_23522
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle New Tests of Randomness for Circular Data
Gehlot, Shriya
Laha, Arnab Kumar
Methodology
62A09, 62H11 (Primary) 62G99 (Secondary)
Randomness or mutual independence is an important underlying assumption for most widely used statistical methods for circular data. Verifying this assumption is essential to ensure the validity and reliability of the resulting inferences. In this paper, we introduce two tests for assessing the randomness assumption in circular statistics, based on random circular arc graphs (RCAGs). We define and analyze RCAGs in detail, showing that their key properties depend solely on the i.i.d. nature of the data and are independent of the particular underlying continuous circular distribution. Specifically, we derive the edge probability and vertex degree distribution of RCAGs under the randomness assumption. Using these results, we construct two tests: RCAG-EP, which is based on edge probability, and RCAG-DD, which relies on the vertex degree distribution. Through extensive simulations, we demonstrate that both tests are effective, with RCAG-DD often exhibiting higher power than RCAG-EP. Additionally, we explore several real-world applications where these tests can be useful.
title New Tests of Randomness for Circular Data
topic Methodology
62A09, 62H11 (Primary) 62G99 (Secondary)
url https://arxiv.org/abs/2506.23522