Related papers: Limit theorems for empirical processes of cluster …

We consider empirical multi-dimensional Rare Events Point Processes that keep track both of the time occurrence of extremal observations and of their severity, for stochastic processes arising from a dynamical system, by evaluating a given…

Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…

Let $X,X_1,X_2,\ldots$ be i.i.d. mean zero random vectors with values in a separable Banach space $B$, $S_n=X_1+\cdots+X_n$ for $n\ge1$, and assume $\{c_n:n\ge1\}$ is a suitably regular sequence of constants. Furthermore, let…

Block maxima methods constitute a fundamental part of the statistical toolbox in extreme value analysis. However, most of the corresponding theory is derived under the simplifying assumption that block maxima are independent observations…

The article describes the limiting distribution of the extremes of observations that arrive in clusters. We start by studying the tail behaviour of an individual cluster and then we apply the developed theory to determine the limiting…

We use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

In the extreme value analysis of time series, not only the tail behavior is of interest, but also the serial dependence plays a crucial role. Drees and Rootz\'en (2010) established limit theorems for a general class of empirical processes…

Let $p_n(y)=\sum_k\hat{\alpha}_k\phi(y-k)+\sum_{l=0}^{j_n-1}\sum_k\hat {\beta}_{lk}2^{l/2}\psi(2^ly-k)$ be the linear wavelet density estimator, where $\phi$, $\psi$ are a father and a mother wavelet (with compact support),…

Let (Z n) n$\ge$0 with Z n = (Z n (i, j)) 1$\le$i,j$\le$p be a p multi-type critical branching process in random environment, and let M n be the expectation of Z n given a fixed environment. We prove theorems on convergence in distribution…

The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…

A central limit theorem is established for a sum of random variables belonging to a sequence of random fields. The fields are assumed to have zero mean conditional on the past history and to satisfy certain conditional $\alpha$-mixing…

Let $Y_i,i\geq1$, be i.i.d. random variables having values in an $m$-dimensional manifold $\mathcal {M}\subset \mathbb{R}^d$ and consider sums $\sum_{i=1}^n\xi(n^{1/m}Y_i,\{n^{1/m}Y_j\}_{j=1}^n)$, where $\xi$ is a real valued function…

Frequentists' inference often delivers point estimators associated with confidence intervals or sets for parameters of interest. Constructing the confidence intervals or sets requires understanding the sampling distributions of the point…

A univariate clustering criterion for stationary processes satisfying a $\beta$-mixing condition is proposed extending the work of \cite{KB2} to the dependent setup. The approach is characterized by an alternative sample criterion function…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

We prove that for q>=1, there exists r(q)<1 such that for p>r(q), the number of points in large boxes which belongs to the infinite cluster has a normal central limit behaviour under the random cluster measure phi_{p,q} on Z^d, d>=2.…

We develop a unified approach to the problem of clustering in the three different fields of applications, as indicated in the title the paper. The approach is based on Khintchine's probabilistic method that grew out of the Darwin-Fawler…

We introduce the aggregated clustering problem, where one is given $T$ instances of a center-based clustering task over the same $n$ points, but under different metrics. The goal is to open $k$ centers to minimize an aggregate of the…

In the regression framework, the empirical measure based on the responses resulting from the nearest neighbors, among the covariates, to a given point $x$ is introduced and studied as a central statistical quantity. First, the associated…