English
Related papers

Related papers: Limit laws for the norms of extremal samples

200 papers

In [18] we have shown that, for $p_{1},p_{2}\in(2,\infty]$, the constants of Bennett's inequality on unimodular bilinear forms on $\ell_{p_{1}}^{n_{1} }\times\ell_{p_{2}}^{n_{2}}$ are asymptotically bounded by $1$. In the present paper we…

Functional Analysis · Mathematics 2021-08-03 Daniel Pellegrino , Anselmo Raposo

Approximations to the modified signed likelihood ratio statistic are asymptotically standard normal with error of order $n^{-1}$, where $n$ is the sample size. Proofs of this fact generally require that the sufficient statistic of the model…

Statistics Theory · Mathematics 2007-12-18 Heping He , Thomas A. Severini

We consider the asymptotic expansion of the sum \[S_p(a;w)=\sum_{n=1}^\infty n^{-w}\e^{-an^p}\] as $a\rightarrow 0$ in $|\arg\,a|<\pi/2$ for arbitrary finite $p>$ and $w>0$. Our attention is concentrated mainly on the case when $p$ and $w$…

Classical Analysis and ODEs · Mathematics 2015-03-26 R. B. Paris

Given a hypergraph $\Gamma=(\Omega,\mathcal{X})$ and a sequence $\mathbf{p} = (p_\omega)_{\omega\in \Omega}$ of values in $(0,1)$, let $\Omega_{\mathbf{p}}$ be the random subset of $\Omega$ obtained by keeping every vertex $\omega$…

Combinatorics · Mathematics 2019-04-18 Frank Mousset , Andreas Noever , Konstantinos Panagiotou , Wojciech Samotij

An important problem in space-time adaptive detection is the estimation of the large p-by-p interference covariance matrix from training signals. When the number of training signals n is greater than 2p, existing estimators are generally…

Signal Processing · Electrical Eng. & Systems 2021-07-26 Benjamin D. Robinson , Robert Malinas , Alfred O. Hero

The "large p, small n" paradigm arises in microarray studies, where expression levels of thousands of genes are monitored for a small number of subjects. There has been an increasing demand for study of asymptotics for the various…

Statistics Theory · Mathematics 2007-06-13 Michael R. Kosorok , Shuangge Ma

For normalized sums $Z_n$ of i.i.d. random variables, we explore necessary and sufficient conditions which guarantee the normal approximation with respect to the R\'enyi divergence of infinite order. In terms of densities $p_n$ of $Z_n$,…

Probability · Mathematics 2024-06-21 Sergey G. Bobkov , Friedrich Götze

It was recently shown that estimating the Shannon entropy $H({\rm p})$ of a discrete $k$-symbol distribution ${\rm p}$ requires $\Theta(k/\log k)$ samples, a number that grows near-linearly in the support size. In many applications $H({\rm…

Information Theory · Computer Science 2016-03-11 Jayadev Acharya , Alon Orlitsky , Ananda Theertha Suresh , Himanshu Tyagi

We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…

Combinatorics · Mathematics 2014-11-14 Igor Kortchemski

A notoriously difficult challenge in extreme value theory is the choice of the number $k\ll n$, where $n$ is the total sample size, of extreme data points to consider for inference of tail quantities. Existing theoretical guarantees for…

Other Statistics · Statistics 2025-05-30 Johannes Lederer , Anne Sabourin , Mahsa Taheri

\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\{\mathcal{X}_{n}(i)$ $:$ $1$ $\leq $ $i$ $\leq $ $\mathcal{L}\}_{n\geq 1}$, where each $\mathcal{X}_{n}(i)$ is assumed to converge in…

Statistics Theory · Mathematics 2018-02-27 Jonathan B. Hill

Let $X_k$ denote the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/N\mathbb{Z}$ or $\{1, \dots, N\}$ where every element is included independently with probability $p$. We determine the asymptotics of $\log…

Probability · Mathematics 2019-11-12 Bhaswar B. Bhattacharya , Shirshendu Ganguly , Xuancheng Shao , Yufei Zhao

We study an asymptotic behavior of the probabilities of first-order properties of random graph G(N,p) in the article. We conider p such that lnp=-alnN, a>0. We find values of parameter a from (1-exp(ln2(1-k)),1) such that the random graph…

Probability · Mathematics 2013-04-04 M. E. Zhukovskii

We consider the Pickands process {equation*} P_{n}(s)=\log (1/s)^{-1}\log \frac{X_{n-k+1,n}-X_{n-[k/s]+1,n}}{% X_{n-[k/s]+1,n}-X_{n-[k/s^{2}]+1,n}}, {equation*} {equation*} (\frac{k}{n}\leq s^2 \leq 1), {equation*} which is a generalization…

Methodology · Statistics 2011-11-21 Gane Samb Lo , Adja Mbarka Fall

Let $\gamma_n $ denote the length of the $n$-th zone of instability of the Hill operator $Ly= -y^{\prime \prime} - [4t\alpha \cos2x + 2 \alpha^2 \cos 4x ] y,$ where $\alpha \neq 0, $ and either both $\alpha, t $ are real, or both are pure…

Mathematical Physics · Physics 2016-09-07 Plamen Djakov , Boris Mityagin

Let $\nu\in M^1([0,\infty[)$ be a fixed probability measure. For each dimension $p\in \mathbb{N}$, let $(X_n^{p})_{n\geq1}$ be i.i.d. $\mathbb{R}^p$-valued random variables with radially symmetric distributions and radial distribution…

Probability · Mathematics 2019-02-20 Waldemar Grundmann

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray

For positive integers $d$ and $p$ such that $d \ge p$, let $\mathbb{R}^{d \times p}$ denote the set of $d \times p$ real matrices, $I_p$ be the identity matrix of order $p$, and $V_{d,p} = \{x \in \mathbb{R}^{d \times p} \mid x'x = I_p\}$…

Statistics Theory · Mathematics 2024-10-22 Armine Bagyan , Donald Richards

In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…

Probability · Mathematics 2020-04-08 Rita Giuliano , Milto Hadjikyriakou

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

Combinatorics · Mathematics 2015-02-20 Pat Devlin , Jeff Kahn