SearcharxivSearch

arXiv subjects

Houyem Demni

Publications and source records attributed to Houyem Demni.

2 recordsLinked to original sources

Robust measures of dispersion for circular data with an anomaly detection rule

Circular variables that represent directions or periodic observations arise in many fields, such as biology and environmental sciences. An important issue when dealing with circular data is how to estimate their dispersion robustly, avoiding undue effects of anomalies. This work extends three robust dispersion measures from the line to the circle. Their robustness is studied via their influence functions and relative bias curves. From these dispersion measures, robust estimators of parameters of circular distributions can be derived. This yields robust estimators for the concentration parameter of the von Mises distribution and the dispersion parameter of the wrapped normal distribution. Their breakdown values and statistical efficiencies are obtained, and they are compared in a simulation study. Building on the best performing estimator, a robust circular anomaly detection procedure is developed, and employed to visualize outliers through a circular violin plot. Three real datasets are analyzed.

stat.ME

A clusterability test for directed graphs

In this article, we extend a statistical test of graph clusterability, the $δ$ test, to directed graphs with no self loops. The $δ$ test, originally designed for undirected graphs, is based on the premise that graphs with a clustered structure display a mean local density that is statistically higher than the graph's global density. We posit that graphs that do not meet this necessary (but not sufficient) condition for clusterability can be considered unsuited to clustering. In such cases, vertex clusters do not offer a meaningful summary of the broader graph. Additionally in this study, we aim to determine the optimal sample size (number of neighborhoods). Our test, designed for the analysis of large networks, is based on sampling subsets of neighborhoods/nodes. It is designed for cases where computing the density of every node's neighborhood is infeasible. Our results show that the $δ$ test performs very well, even with very small samples of neighborhoods ($1\%$). It accurately detects unclusterable graphs and is also shown to be robust to departures from the underlying assumptions of the $t$ test.

cs.NI