相关论文: Asymptotic independence of three statistics of max…

We prove an asymptotic Cram\'er's theorem, that is, if the sequence $(X_{n}+ Y_{n})_{n\geq 1}$ converges in law to the standard normal distribution and for every $n\geq 1$ the random variables $X_{n}$ and $Y_{n}$ are independent, then…

We prove a central limit theorem for random sums of the form $\sum_{i=1}^{N_n} X_i$, where $\{X_i\}_{i \geq 1}$ is a stationary $m-$dependent process and $N_n$ is a random index independent of $\{X_i\}_{i\geq 1}$. Our proof is a…

The article studies the almost surely asymptotics of extreme values $\bar{\xi}_n = \max_{1\leq i \leq n} \xi_i$, where $ \xi , \xi_1 , \xi_2 , \ldots$ are discrete identically distributed random variables. One of the main results on this…

In previous papers, we studied the asymptotic behaviour of $S_N(A,X)=(2N+1)^{-d/2}\sum_{n \in A_N} X_n,$ where $X$ is a centered, stationary and weakly dependent random field, and $A_N=A \cap [-N,N]^d$, $A \subset \mathbb{Z}^d$. This leads…

For a set of dependent random variables, without stationary or the strong mixing assumptions, we derive the asymptotic independence between their sums and maxima. Then we apply this result to high-dimensional testing problems, where we…

We consider two independent binary i.i.d. random strings $X$ and $Y$ of equal length $n$ and the optimal alignments according to a symmetric scoring functions only. We decompose the space of scoring functions into five components. Two of…

We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected…

Let $\mathbf{X}(n) \in \mathbb{R}^d$ be a sequence of random vectors, where $n\in\mathbb{N}$ and $d = d(n)$. Under certain weakly dependence conditions, we prove that the distribution of the maximal component of $\mathbf{X}$ and the…

The empirical mean of $n$ independent and identically distributed (i.i.d.) random variables $(X_1,\dots,X_n)$ can be viewed as a suitably normalized scalar projection of the $n$-dimensional random vector $X^{(n)}\doteq(X_1,\dots,X_n)$ in…

Let $\tau(x)$ be the first time the reflected process $Y$ of a Levy processes $X$ crosses x>0. The main aim of the paper is to investigate the asymptotic dependence of the path functionals: $Y(t) = X(t) - \inf_{0\leq s\leq t}X(s)$,…

It is well known that an extreme order statistic and a central order statistic (os) as well as an intermediate os and a central os from a sample of iid univariate random variables get asymptotically independent as the sample size increases.…

Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy explorations and provide sufficient conditions for this…

A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (2000) showed that the number $S_n$ of score sequences on the…

This note displays an interesting phenomenon for percentiles of independent but non-identical random variables. Let $X_1,\cdots,X_n$ be independent random variables obeying non-identical continuous distributions and $X^{(1)}\geq \cdots\geq…

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

Let $\mathbf{X}_1,...,\mathbf{X}_n$ be a random sample from a $p$-dimensional population distribution. Assume that $c_1n^{\alpha}\leq p\leq c_2n^{\alpha}$ for some positive constants $c_1,c_2$ and $\alpha$. In this paper we introduce a new…

Let $\{X_{n}(t), t\in[0,\infty)\}, n\in\mathbb{N}$ be a sequence of centered dependent stationary Gaussian processes. The limit distribution of $\sup_{t\in[0,T(n)]}|X_{n}(t)|$ is established as $r_{n}(t)$, the correlation function of…

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

The asymptotic results that underlie applications of extreme random fields often assume that the variables are located on a regular discrete grid, identified with $\mathbb{Z}^2$, and that they satisfy stationarity and isotropy conditions.…