Related papers: Weight distribution of random linear codes and Kra…
Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…
Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a…
In nonparametric statistical problems, we wish to find an estimator of an unknown function f. We can split its error into bias and variance terms; Smirnov, Bickel and Rosenblatt have shown that, for a histogram or kernel estimate, the…
Fix a space dimension $d\ge 2$, parameters $\alpha > -1$ and $\beta \ge 1$, and let $\gamma_{d,\alpha, \beta}$ be the probability measure of an isotropic random vector in $\mathbb{R}^d$ with density proportional to \begin{align*}…
We establish several optimal moment comparison inequalities (Khinchin-type inequalities) for weighted sums of independent identically distributed symmetric discrete random variables which are uniform on sets of consecutive integers.…
We obtain asymptotics of large Hankel determinants whose weight depends on a one-cut regular potential and any number of Fisher-Hartwig singularities. This generalises two results: 1) a result of Berestycki, Webb and Wong [5] for root-type…
We develop techniques to compute the k-th Moment of the Eigenvalue-statistic for a random Matrix M the entries of which do not have to be necessarily Independent. The dependence is controlled via an equivalence relation on the pairs of the…
We examine the asymptotics of the moments of characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, in the limit as $N\to\infty$. We focus in particular on the Gaussian Unitary…
We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of…
In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…
For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…
The Pitman sampling formula has been intensively studied as a distribution of random partitions. One of the objects of interest is the length $K (= K_{n,\theta,\alpha})$ of a random partition that follows the Pitman sampling formula, where…
The "typical" asymptotic behavior of the weighted sums of independent, identically distibuted random vectors in k-dimensional space is considered. It is shown that under finitnes of fifth absolute moment of an individual term the rate of…
There are several ways to establish the asymptotic normality of $L$-statistics, which depend on the choice of the weights-generating function and the cumulative distribution selection of the underlying model. In this study, we focus on…
We establish asymptotic normality of weighted sums of periodograms of a stationary linear process where weights depend on the sample size. Such sums appear in numerous statistical applications and can be regarded as a discretized versions…
Keating and Snaith showed that the $2k^{th}$ absolute moment of the characteristic polynomial of a random unitary matrix evaluated on the unit circle is given by a polynomial of degree $k^2$. In this article, uniform asymptotics for the…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
The Kaczmarz method for solving a linear system $Ax = b$ interprets such a system as a collection of equations $\left\langle a_i, x\right\rangle = b_i$, where $a_i$ is the $i-$th row of $A$, then picks such an equation and corrects $x_{k+1}…
In this article, we show that a linear combination $X$ of $n$ independent, unbiased Bernoulli random variables $\{X_k\}$ can match the first $2n$ moments of a random variable $Y$ which is uniform on an interval. More generally, for each $p…
We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include…